Register

Recent questions tagged sorting

0 votes
1 answer
151
best algo to sort 1 million item
what is the best algorithm to sort a list of more than 1 million items in an array a)quicksort b) merge sort c)heap sort d) bubble sort
what is the best algorithm to sort a list of more than 1 million items in an arraya)quicksort b) merge sort c)heap sort d) bubble sort
User Avatar
0 votes
1 answer
154
algo questions
in case of comparision sort max possible is n(n-1)/2
in case of comparision sort max possible is n(n-1)/2
User Avatar
0 votes
1 answer
156
merge sort
given n elements merge them into one sorted list using merge procedure then what is the time complexity for this ? explain with example
given n elements merge them into one sorted list using merge procedure then what is the time complexity for this ?explain with example
User Avatar
0 votes
2 answers
159
Self doubt on sorting algorithm
What is the average case time complexity of the best sorting algorithm for an array having 2^n^2 elements . I know that the best sorting algorithm is no better than O(n log n).Please answer in terms of the asymptotic notation.
What is the average case time complexity of the best sorting algorithm for an array having 2^n^2 elements .I know that the best sorting algorithm is no better than O(n lo...
User Avatar
1 votes
0 answers
161
sorting
just tell me about the quick sort
just tell me about the quick sort
User Avatar
0 votes
2 answers
163
MadeEasy Test Series: Algorithms - Sorting
Consider the following scenario during insertion sort when the array looks like the following: {25,75,95,125,80,5,10} The number of comparisons that it will further take for the array to be completely sorted are______?
Consider the following scenario during insertion sort when the array looks like the following:{25,75,95,125,80,5,10}The number of comparisons that it will further take fo...
User Avatar
0 votes
3 answers
164
Find total number of comparisons needed
What is the total number of comparisons needed in the best case to find minimum and maximum of $300 $ elements?
What is the total number of comparisons needed in the best case to find minimum and maximum of $300 $ elements?
User Avatar
1 votes
0 answers
165
radix sort counting sort
Given an array where numbers are in range from 1 to n6, which sorting algorithm can be used to sort these number in linear time? 1)Counting Sort 2)Radix Sort 3)Bubble Sort 4)Merge Sort.
Given an array where numbers are in range from 1 to n6, which sorting algorithm can be used to sort these number in linear time?1)Counting Sort2)Radix Sort3)Bubble Sort4)...
User Avatar
3 votes
1 answer
166
Merge sort
How many swaps are performed in Merge sort algorithm in worst case?
How many swaps are performed in Merge sort algorithm in worst case?
User Avatar
0 votes
3 answers
167
Merge Sort Doubt
what is the recurrence relation for merge sort?
what is the recurrence relation for merge sort?
User Avatar
0 votes
1 answer
168
Self Doubt
What is adaptive algorithm and is merge sort and quick sort is adaptive?
What is adaptive algorithm and is merge sort and quick sort is adaptive?
User Avatar
0 votes
1 answer
169
ACE algo test series
Ans given is option-B
Ans given is option-B
User Avatar
0 votes
1 answer
170
sorting
Given an array where numbers are in range from 1 to n6 , which sorting algorithm can be used to sort these number in linear time? A. Not possible to sort in linear time B: Counting Sort C: Radix Sort D. Quick Sort
Given an array where numbers are in range from 1 to n6 , which sorting algorithm can beused to sort these number in linear time?A. Not possible to sort in linear timeB: C...
User Avatar
1 votes
2 answers
171
self doubt
What is the worst case time complexity of Quick Sort? Is it nlogn or n2
What is the worst case time complexity of Quick Sort?Is it nlogn or n2
User Avatar
3 votes
1 answer
172
GB DSA-Test 4-Question 17
If Radix sort is used to sort an array of n integers which are in the range , where d is some function of input size, the time taken would be? (A) (B) (C) (D)
If Radix sort is used to sort an array of n integers which are in the range ,where d is some function of input size, the time taken would be?(A) (B)(C) (D)
User Avatar
0 votes
1 answer
173
Randomized Quicksort
True or False : In randomized quicksort , each key is involved in the same number of comparisons.
True or False :In randomized quicksort , each key is involved in the same number of comparisons.
User Avatar
0 votes
1 answer
176
ALGORITHMS
Is straight merge sort in gate syllabus?? If yes, where to study from?
Is straight merge sort in gate syllabus?? If yes, where to study from?
User Avatar
0 votes
1 answer
177
merge sort
n sorted subarrays each of size log n. find single sorted array with all elements.find time complexity
n sorted subarrays each of size log n. find single sorted array with all elements.find time complexity
User Avatar
0 votes
1 answer
179
Time complexity
User Avatar
Page: