Register

Recent questions tagged sorting

0 votes
1 answer
301
complexity analysis
Space complexity = input size + extra space So, heap sort also takes input of an 'n' size array. Does this mean that space cost of heap sort algo is O (n).
Space complexity = input size + extra spaceSo, heap sort also takes input of an 'n' size array.Does this mean that space cost of heap sort algo is O (n).
User Avatar
2 votes
3 answers
302
Finding the second element neither minimum nor maximum
How many comparisons are there for finding any second element that is neither minimum or maximum. 10 5 50 70 80 2 3
How many comparisons are there for finding any second element that is neither minimum or maximum.10 5 50 70 80 2 3
User Avatar
6 votes
3 answers
303
Merge Sort Comparisons
Q . 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)NOT My doubt is here ,Are we considering a specific Item throughout our Analysis.?
Q . 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)NOTMy doubt is here ,Are we cons...
User Avatar
1 votes
2 answers
304
geeksforgeeks
In a modified merge sort, the input array is splitted at a position one-third of the length(N) of the array. What is the worst case time complexity of this merge sort? A N(logN base 3) B N(logN base 2/3) C N(logN base 1/3) D N(logN base 3/2)
In a modified merge sort, the input array is splitted at a position one-third of the length(N) of the array. What is the worst case time complexity of this merge sort?AN(...
User Avatar
0 votes
1 answer
305
DSSB_2017
A sorting algorithm is called stable if 1.It takes O(n log n) time 2.It maintains relative order of occurrence of non-distinct elements 3.It uses divide and conquer paradigm 4.It takes linear time
A sorting algorithm is called stable if1.It takes O(n log n) time2.It maintains relative order of occurrence of non-distinct elements3.It uses divide and conquer paradig...
User Avatar
1 votes
3 answers
306
Self doubt
You are asked to sort 15 randomly generated numbers. One should prefer— (a) Bubble sort (b) Quick sort (c) Merge sort (d) Heap sort I think the answer should be c or d crct me???
You are asked to sort 15 randomly generated numbers. One should prefer—(a) Bubble sort (b) Quick sort (c) Merge sort (d) Heap sortI think the answer should be c or d cr...
User Avatar
4 votes
2 answers
307
Sorting
We need to sort 7 numbers each of 4 digits. What is the number of comparisons in worst case . Options are as follows: 1) 40 2) 38 3) 47 4) 280
We need to sort 7 numbers each of 4 digits. What is the number of comparisons in worst case . Options are as follows:1) 402) 383) 474) 280
User Avatar
0 votes
1 answer
309
Doubt
CAn anyone explian about 2-way merge sort ? (You can take example from GATE1999-1.14, ISRO2015-42)
CAn anyone explian about 2-way merge sort ?(You can take example from GATE1999-1.14, ISRO2015-42)
User Avatar
9 votes
5 answers
313
ISRO2017-49
The number of swappings needed to sort the numbers $8 , 22, 7, 9, 31, 5, 13$ in ascending order using bubble sort is $11$ $12$ $13$ $10$
The number of swappings needed to sort the numbers $8 , 22, 7, 9, 31, 5, 13$ in ascending order using bubble sort is$11$$12$$13$$10$
User Avatar
10 votes
5 answers
314
ISRO2017-15
Which one of the following in-place sorting algorithms needs the minimum number of swaps? Insertion Sort Quick Sort Heap Sort Selection Sort
Which one of the following in-place sorting algorithms needs the minimum number of swaps?Insertion SortQuick SortHeap SortSelection Sort
User Avatar
4 votes
1 answer
316
Selection sort and Insertion sort
Selection sort is an example of ____(I)_______ and insertion sort is an example of __(II)______. a) I- Greedy, II- Brute Force b) I- Brute Force II- Divide and conquer c) I- Greedy II- Divide and conquer d) I- Brute Force II- Brute Force
Selection sort is an example of ____(I)_______ and insertion sort is an example of __(II)______.a) I- Greedy, II- Brute Forceb) I- Brute Force II- Divide and conquerc) I-...
User Avatar
0 votes
2 answers
318
Sorting
Which sorting algorithim is best if exhactly only half of the elements are in correct position ?
Which sorting algorithim is best ifexhactly only half of the elements are in correct position ?
User Avatar
1 votes
3 answers
319
Which sorting algorithm can be used to sort a random linked list with minimum time complexity ?
Which sorting algorithm can be used to sort a random linked list with minimum time complexity ? A)mergesort B)quicksort C)radixsort D)insertionsort E)heapsort
Which sorting algorithm can be used to sort a random linked list with minimum time complexity ?A)mergesortB)quicksortC)radixsortD)insertionsortE)heapsort
User Avatar
2 votes
3 answers
320
With quick sort The results after first partioning of the given array
With quick sort The results after first partioning of the given array. A = (2,8,7,1,3,5,6,4,9). Analysis the time complexity of Quick sort in the best case.
With quick sort The results after first partioning of the given array. A = (2,8,7,1,3,5,6,4,9).Analysis the time complexity of Quick sort in the best case.
User Avatar
0 votes
1 answer
322
cormen
why does radix sort uses stable sort i.e counting sort as an intermediate sorting algorithm?
why does radix sort uses stable sort i.e counting sort as an intermediate sorting algorithm?
User Avatar
0 votes
2 answers
323
cormen
counting sort assumes that each of the n input is an integer in the range 0 to k, for some integer k. please explain when k=O(n), the sort run in O(n) time.
counting sort assumes that each of the n input is an integer in the range 0 to k, for some integer k.please explain when k=O(n), the sort run in O(n) time.
User Avatar
1 votes
1 answer
324
complexity
Let there are n elements in array and number of sorted subarray is log n of size n/ log n each then what is the time complexity to sort given array
Let there are n elements in array and number of sorted subarray is log n of size n/ log n each thenwhat is the time complexity to sort given array
User Avatar
0 votes
1 answer
325
Ace Test Series: Algorithms - Sorting
The tightest lower bound on the number of comparisons, in worst case for comparison based sorting is of the order of ? (A)$n$ (B)$n^2$ (C)$nlogn$ (D)$n \space{log\space n}^2$
The tightest lower bound on the number of comparisons, in worst case for comparison based sorting is of the order of ?(A)$n$(B)$n^2$(C)$nlogn$(D)$n \space{log\space n}^2$...
User Avatar
1 votes
1 answer
326
algorithm, Sorting
which sorting algorihm is used if we have a telephone directory wit 1,00,000 entries ?
which sorting algorihm is used if we have a telephone directory wit 1,00,000 entries ?
User Avatar
1 votes
1 answer
327
bubble sort
A machine takes 200 second to sort 200 names, using bubble sort . In 800 seconds , it can approximately sort how many names?
A machine takes 200 second to sort 200 names, using bubble sort . In 800 seconds , it can approximately sort how many names?
User Avatar
0 votes
2 answers
328
best case complexity
Which of the following sorting algorithms has/have minimum running time complexity in best case? I. Selection Sort II. Insertion Sort a. I b. II c. Both have same minimum running time complexity
Which of the following sorting algorithms has/have minimum running time complexity in best case?I. Selection SortII. Insertion Sorta. Ib. IIc. Both have same minimum runn...
User Avatar
1 votes
1 answer
330
Test by Bikram | Mock GATE | Test 3 | Question: 22
Bubble sort is used to sort the following sequence of numbers: $7 5 3 1 2 9$. What will the sequence be after the 2$^{nd}$ iteration? $1$ $2$ $3$ $5$ $7$ $9$ $3$ $1$ $2$ $5$ $7$ $9$ $5$ $3$ $1$ $2$ $7$ $9$ $3$ $5$ $7$ $1$ $2$ $9$
Bubble sort is used to sort the following sequence of numbers: $7 5 3 1 2 9$.What will the sequence be after the 2$^{nd}$ iteration?$1$ $2$ $3$ $5$ $7$ $9$$3$ $1$ $2$ $5$...
User Avatar
Page: