Register

Recent questions tagged sorting

1 votes
1 answer
181
# Heap sort
Sort The Following Sequence of input using Heap sort. { 10 , 2 , 1 , 5, 3 ,8 ,11,24 ,7 } Please show the output at every pass because i am getting confused.
Sort The Following Sequence of input using Heap sort.{ 10 , 2 , 1 , 5, 3 ,8 ,11,24 ,7 }Please show the output at every pass because i am getting confused.
User Avatar
0 votes
0 answers
182
what is correct answer algo
https://gateoverflow.in/20617/tifr2011-b-31 1+2(n-2) is correct ???i.e option d looks more correct....??
https://gateoverflow.in/20617/tifr2011-b-311+2(n-2) is correct ???i.e option d looks more correct....??
User Avatar
0 votes
0 answers
183
can we apply insertion sort also ??
https://gateoverflow.in/688/gate2000-17 there is swap between adjacent element in insertion sort also??
https://gateoverflow.in/688/gate2000-17there is swap between adjacent element in insertion sort also??
User Avatar
0 votes
1 answer
185
algorithm self doubt
suppose we are given a sorted array ....and we need to extract minimum every tym what is the time complexity?? and what is the tym complexity to delete the minimum ? are they both same ?? and what is the tym complexity to delete an element?
suppose we are given a sorted array ....and we need to extract minimum every tym what is the time complexity??and what is the tym complexity to delete the minimum ? are ...
User Avatar
4 votes
1 answer
186
Gateforum Test Series: Algorithms - Sorting
. In the standard merge sort algorithm on a list of size n, what is the maximum number of times an item can be compared? a)2 b)logn c)n-1 d)nlogn
. In the standard merge sort algorithm on a list of size n, what is the maximum number of times an item can be compared?a)2b)lognc)n-1d)nlogn
User Avatar
0 votes
2 answers
192
self doubt
Best and Worst case input for: 1. Selection Sort 2. Insertion Sort 3. Merge Sort 4. Quick Sort 5. Bucket Sort 6. Counting Sort 7. Bubble Sort
Best and Worst case input for:1. Selection Sort2. Insertion Sort3. Merge Sort4. Quick Sort5. Bucket Sort6. Counting Sort7. Bubble Sort
User Avatar
0 votes
1 answer
193
Binary search
The minimum number of comparisons required to determine if an integer appears more than n/2 times in a sorted array of n integers is (A) (n) (B) (logn) (C) (log*n) (D) (1)
The minimum number of comparisons required to determine if an integer appears more than n/2 times in a sorted array of n integers is(A) (n)(B) (logn)(C) (log*n)(D) (1)
User Avatar
0 votes
1 answer
194
Ace Algorithms
If given numbers are 12,7,15,8,19,20,17,21,5,3 in _______ passes of quick sort element 5 will be in sorted position. (Considering last element as pivot)
If given numbers are 12,7,15,8,19,20,17,21,5,3 in _______ passes of quick sort element 5 will be in sorted position. (Considering last element as pivot)
User Avatar
0 votes
1 answer
195
self doubt
worst no. of comparision required for sort n numbers by insertion sort and selection sort if: 1. Array is already sorted. 2. Array is sorted but in descending order. 3. Array is not sorted.
worst no. of comparision required for sort n numbers by insertion sort and selection sort if:1. Array is already sorted.2. Array is sorted but in descending order.3. Arra...
User Avatar
0 votes
0 answers
196
Sorting
Let P be a Quicksort Program to sort numbers in ascending order using the first element as pivot. Let t1 and t2 be the number of comparisons made by P for the inputs {1, 2, 3, 4, 5} and {4,1, 5, 3, 2} respectively. Which one of the following holds? A. t1 = 5 B. t1< t2 C. t1> t2 D. t1 = t2
Let P be a Quicksort Program to sort numbers in ascending order using the first element aspivot. Let t1 and t2 be the number of comparisons made by P for the inputs {1, 2...
User Avatar
1 votes
2 answers
197
Sorting
Could a binary search tree be built using o(n lg n) comparisons in the comparison model? Explain why or why not.
Could a binary search tree be built using o(n lg n) comparisons in the comparisonmodel? Explain why or why not.
User Avatar
1 votes
1 answer
199
Ace volume-2 divide and conquer method
suppose merge sort takes 2 sec to sort a set of 64 keys then how much time will take to sort a set of 512 keys? here, ans is 24 sec how it is plz explain me.
suppose merge sort takes 2 sec to sort a set of 64 keys then how much time will take to sort a set of 512 keys?here, ans is 24 sec how it is plz explain me.
User Avatar
1 votes
1 answer
200
Massachusetts Institute of Technology Professors Ron Rivest and Srini Devadas
There exists a comparison sort of 5 numbers that uses at most 6 comparisons in the worst case. True or False and Why?
There exists a comparison sort of 5 numbers that uses at most 6 comparisons in the worst case.True or False and Why?
User Avatar
0 votes
1 answer
202
algorithm corman
Insertion sort uses an incremental approach for designing algorithm can someone please explain?
Insertion sort uses an incremental approach for designing algorithm can someone please explain?
User Avatar
0 votes
1 answer
203
sorting
Given 2-sorted arrays each of n-elements and distinct. How much time it will take to find middle element of the union sorted array? a) O(1) b) O(logn) c) O(n) d) None of these explain briefly.
Given 2-sorted arrays each of n-elements and distinct. How much time it will take to find middle element of the union sorted array?a) O(1)b) O(logn)c) O(n)d) None of thes...
User Avatar
0 votes
2 answers
204
sorting
The maximum number of swap possible of an unsorted array[1....n] in quicksort is? a) O(n) b) O($n^{2}$) Explain briefly.
The maximum number of swap possible of an unsorted array[1....n] in quicksort is?a) O(n)b) O($n^{2}$)Explain briefly.
User Avatar
0 votes
2 answers
205
Time complexity
Given two sorted arrays each of n elements and distinct .how much time it will take to find the middle element of the union sorted array ? 1.O(1) 2.O(logn) 3.O(n) 4.none of these .
Given two sorted arrays each of n elements and distinct .how much time it will take to find the middle element of the union sorted array ?1.O(1)2.O(logn)3.O(n)4.none of t...
User Avatar
0 votes
2 answers
206
Self doubt
The total number of comparions required to merge 4 sorted files containing 15, 3, 9 and 8 records into a single sorted file is A. 66 B. 39 C. 15 D. 33
The total number of comparions required to merge 4 sorted files containing 15, 3, 9 and 8 records into a single sorted file is A.66 B.39 C.15 D.33
User Avatar
1 votes
1 answer
207
Self doubt
When sorting technique is called stable?
When sorting technique is called stable?
User Avatar
4 votes
7 answers
208
Searching
Q) Consider a sorted array of n numbers. What would be the time complexity of the best known algorithm to find a pair a and b such that |a-b| = k , k being a positive integer. a) O(logn) b) O(n) c)O(nlogn) d)O(n^2) Which of the option is Correct And Why?
Q) Consider a sorted array of n numbers. What would be the time complexity of the best known algorithm to find a pair a and b such that |a-b| = k , k being a positive int...
User Avatar
0 votes
3 answers
209
Merge Sort
A list of n string, each of length n, is sorted into lexicographic order using the merge-sort algorithm. The worst case running time of this computation is (A) (B) (C) (D)
A list of n string, each of length n, is sorted into lexicographic order using the merge-sort algorithm. The worst case running time of this computation is(A) (B) (C) (D)...
User Avatar
0 votes
1 answer
210
Sorting:
You have to sort 1 GB of data with only 100 MB of available main memory. Which sorting technique will be most appropriate? 1)QuickSort 2)MergeSort 3)HeapSort 4)Selection Sort Explain? How
You have to sort 1 GB of data with only 100 MB of available main memory. Which sorting technique will be most appropriate?1)QuickSort2)MergeSort3)HeapSort4)Selection Sort...
User Avatar
Page: