Register

Recent questions tagged sorting

2 votes
1 answer
272
algorithm
Suppose A is sorted array and some of the elements are duplicates what is the best upper bound to find out the number of elements that are equal to any given key 'k'.
Suppose A is sorted array and some of the elements are duplicates what is the best upper bound to find out the number of elements that are equal to any given key 'k'.
User Avatar
2 votes
0 answers
273
Sorting
If we are asked to find best comparison based sorting algorithm to sort n numbers having d digit's and in the range from [1-k]. If I say it is quick sort or merge sort or heap sort is it wrong ? OR in general we do sorting on these type of numbers using Radix sort only ?
If we are asked to find best comparison based sorting algorithm to sort n numbers having d digit's and in the range from [1-k].If I say it is quick sort or merge sort or ...
User Avatar
0 votes
1 answer
275
Algorithm doubt
In sorted array of size n time required to verify if there exist 2 number a and b such that a+ b = s in worst case Where s is a constant.
In sorted array of size n time required to verify if there exist 2 number a and b such that a+ b = s in worst case Where s is a constant.
User Avatar
3 votes
2 answers
277
Time complexity
Given a 2D array X[m][n] which has m rows and n columns. The array X is row wise and column wise sorted (i.e) each individula row and column is sorted. What is the complexity to search an element in this array a)O(m*n) b)O(m2) or O(n2) c)O(log2(m*n)) d)O(m+n)
Given a 2D array X[m][n] which has m rows and n columns. The array X is row wise and column wise sorted (i.e) each individula row and column is sorted. What is the comple...
User Avatar
4 votes
1 answer
278
Merge sort
True or False Merge sort on Linked list takes O(nlogn)
True or FalseMerge sort on Linked list takes O(nlogn)
User Avatar
4 votes
4 answers
280
Ace Test Series: Algorithms - Sorting
Consider bottom-up merge sort working on 'n' elements. Assume 'n' is a power of 2. The minimum number of comparisons in order to get sorted list is (A) (n log n) / 2 (B) n lon n - n + 1 (C) n log n (D) n log n + n
Consider bottom-up merge sort working on 'n' elements. Assume 'n' is a power of 2. The minimum number of comparisons in order to get sorted list is(A) (n log n) / 2(B) n ...
User Avatar
1 votes
1 answer
281
made easy test
User Avatar
1 votes
1 answer
282
QUICKSORT
Could anyone describe how the partitioning algorithm vary when the pivot is varied ? In Cormen , last element is taken as pivot . Suppose I took first element or middle element or 3 rd element as pivot then how the partitioning algorithm will change.
Could anyone describe how the partitioning algorithm vary when the pivot is varied ?In Cormen , last element is taken as pivot . Suppose I took first element or middle e...
User Avatar
1 votes
2 answers
284
Bucket sort
1. Is bucket sort always stable or does it depend on the sorting subroutine used by bucket sort toe sort the buckets? 2. Bucket sort is always NOT inplace.Is this correct?
1. Is bucket sort always stable or does it depend on the sorting subroutine used by bucket sort toe sort the buckets?2. Bucket sort is always NOT inplace.Is this correct...
User Avatar
1 votes
1 answer
285
arrange the sorting algorithms ascending wise
What is the ascending wise order of sorting algorithms which takes least time and least space to sort the elements?
What is the ascending wise order of sorting algorithms which takes least time and least space to sort the elements?
User Avatar
3 votes
3 answers
286
Quick Sort
"Quick sort has good cache performance" , Can anyone explain this statement.How is cache related to quick sort.I searched for this over the internet but could not find a good article.
"Quick sort has good cache performance" , Can anyone explain this statement.How is cache related to quick sort.I searched for this over the internet but could not find a ...
User Avatar
3 votes
3 answers
288
Sorted List
suppose there are 4 sorted lists of n/4 elements each. if we merge these list into a single sorted list of n elements, for the n=400 number of key comparisons in the worst case using an efficient algorithm is
suppose there are 4 sorted lists of n/4 elements each. if we merge these list into a single sorted list of n elements, for the n=400 number of key comparisons in the wors...
User Avatar
1 votes
1 answer
289
Please solve this Q
What could be the best algorithm from the following when the time complexity is measured based bon the number of swaps performed by the sorting algorithm? 1. Selection sort 2. Insertion sort 3. Bubble sort 4. None of these
What could be the best algorithm from the following when the time complexity is measured based bon the number of swaps performed by the sorting algorithm?1. Selection sor...
User Avatar
3 votes
1 answer
290
Quick sort
When array is already sorted in reverse order then what will be the recurrence relation for number of swaps on array of n elements using quick sort?
When array is already sorted in reverse order then what will be the recurrence relation for number of swaps on array of n elements using quick sort?
User Avatar
2 votes
2 answers
291
merge sort no. of levels when input is n ??
HOW NO. OF LEVELS IS LOG N + 1 CAN ANYONE HELP ME , how to solve this and get log n + 1
HOW NO. OF LEVELS IS LOG N + 1 CAN ANYONE HELP ME , how to solve this and get log n + 1
User Avatar
1 votes
1 answer
293
algorithm
array has n elements and we need to sort them in non decreasing order as follows. first find minimum, remove this element from the array and find minimum of remaining elements, remove this element and so on until array becomes emplty . In best case how many comparisons needed
array has n elements and we need to sort them in non decreasing order as follows. first find minimum, remove this element from the array and find minimum of remaining ele...
User Avatar
1 votes
1 answer
294
algorithm
Array of 1 to n^6 , which algorithm can be used to sort in linear time? a) not possible B)radix c)counting d)quick
Array of 1 to n^6 , which algorithm can be used to sort in linear time?a) not possibleB)radixc)countingd)quick
User Avatar
1 votes
0 answers
295
number of movements in Insertion sort
will A[i+1]=key; in the insertion sort be counted as a movement in best case?
will A[i+1]=key; in the insertion sort be counted as a movement in best case?
User Avatar
1 votes
1 answer
296
Daa........
What is the ans and give reason
What is the ans and give reason
User Avatar
1 votes
1 answer
297
Complexity
What is the method to find the time complexity to search an element which appears more than 20% in sorted array having n elements. and also for 1% or 40% .
What is the method to find the time complexity to search an element which appears more than 20% in sorted array having n elements.and also for 1% or 40% .
User Avatar
2 votes
1 answer
299
Insertion Sort
How to get Time Complexity of finding the number of inversions in an array?
How to get Time Complexity of finding the number of inversions in an array?
User Avatar
2 votes
1 answer
300
Introduction To Algorithms 8.3-2
How are heap sort and quick sort not stable?
How are heap sort and quick sort not stable?
User Avatar
Page: