Register

Recent questions tagged sorting

1.3k
views
1 answers
4 votes
ME Mock 4
Consider a new sorting algorithm similar to the BubbleSort algorithm, called RumbleSort. Given an array as input, RumbleSort attempts to sort the array and produces a sorted ... $\mathcal Ο(n^2)$ Which of the above statements is/are true?
User Avatar
3.2k
views
2 answers
3 votes
MadeEasy WorkBook: Algorithms - Sorting
Consider the following array with 7 elements for insertion sort?25, 15, 30, 9, 99, 20, 26 In how many passes, the given sequence will be sorted? (a) 4 pass ... pass (d) More than 6 passAnswer is 6 passes. Can anyone explain it step by step.
User Avatar
733
views
0 answers
0 votes
Merge sort
What is the extra memory needed for merge sort:1] In case of Iterative merge sort.(DS:Array)2]In case of Recursive merge sort.(DS:Array)3] In case of Iterative merge sort.(DS:Linked List)4]In case of Recursive merge sort.(DS:Linked List)
User Avatar
1.6k
views
4 answers
3 votes
MadeEasy Test Series: Algorithms - Sorting
Consider a scenario of modified quick sort, where we have given an input sorted array A[1 .. . n], all elements of array are distinct and n >=3. Pivot is the median of set of 3 ... sort?a.O($n^{2}$)b.O(nlogn)c.O($n^{2}$logn)d.O(nloglogn)
User Avatar
731
views
1 answers
1 votes
Self Doubt
The average no. of comparisons performed by the merge sort algorithm, in merging 2 sorted lists of length 2 is___________.Ans: $\frac{8}{3}$
User Avatar
406
views
1 answers
0 votes
Self Doubt Algorithms
When relative ordering of equal keys is preserved after sorting then it is called stable. Quick sort and heap sort is not a stable sorting algorithm . Doubt---IS Selection sort not a stable sorting algorithm ?
User Avatar
949
views
1 answers
2 votes
sorted list
we are given (log m) sorted list each of size (log n) / (log m) the time complexity of merging list into single sorted list using mergesort is equal to a) O ( log m log(log n) ) ... ) c) O ( log m log n) d) O ( m log log n)
User Avatar
529
views
0 answers
0 votes
ME_test_series
An array A of size n is known to be sorted except for the first k elements and the last k elements, where K is a constant. Which of the following ... sortD.) bubble sortI can't understand how can insertion sort be better in this case?
User Avatar
266
views
2 answers
0 votes
ME TEST SERIES
User Avatar
1.1k
views
0 answers
0 votes
Merge Sort
Can anyone help me to understand this problem….??
User Avatar
543
views
1 answers
0 votes
UPPCL AE 2018:46
Which one of the following algorithms cannot sort $n$ numbers in $O(n)$ comparisons?Counting sortRadix sortHeap sortBucket sort
User Avatar
324
views
1 answers
0 votes
UPPCL AE 2018:20
Which of the following is not a stable sorting algorithm in its typical implementation?Merge sortBubble sortQuick sortInsertion sort
User Avatar
1.2k
views
0 answers
0 votes
UGC NET CSE | December 2018 | Part 2 | Question: 30
The second smallest of $n$ elements can be found with ____ comparisons in the worst case.$n-1$\lg \: n$n + ceil(\lg \: n)-2$\frac{3n}{2}$
User Avatar
698
views
0 answers
0 votes
MadeEasy Test Series: Programming & DS - Sorting
An array A of size n is known to be sorted except for the first k elements and the last k elements, where k is a constant. Which of the ... the best choice for sorting the array A?a-Insertion Sortb-Bubble sortc-Quicksortd-Selection sort
User Avatar
1.7k
views
1 answers
6 votes
GATE Overflow | Mock GATE | Test 1 | Question: 62
Which of the following sorting algorithms performs efficiently to sort a singly linked list containing $\log n$ ... n ))$\text{Quick sort, } O ( \log 2)(\log n ))$
User Avatar
9.1k
views
1 answers
1 votes
Highest best case implies worst case?
Which of the below given sorting techniques has highest best-case runtime complexity.(A) Quick sort(B) Selection sort(C) Insertion sort(D) Bubble sortAnswer: (B) ... case time should be O(n) sorting method what does highest best cases mean?
User Avatar
848
views
0 answers
0 votes
Self Doubt
Please correct if any of the point is wrong :Quicksort:1.Need more random accesses2 Used when Random access is fast (hence preferred on array and not on ... makes it faster than merge sort in many cases like in virtual memory environment.
User Avatar
1.3k
views
1 answers
0 votes
cormen 7.2 -5
Suppose that the splits at every level of quicksort are in the proportion 1 - α to α, where 0 < α ≤ 1/2 is a constant. Show that ... but couldn't understand https://stackoverflow.com/questions/17684680/maximum-and-minimum-depth-of-quicksort
User Avatar
2.5k
views
4 answers
2 votes
MadeEasy Subject Test 2019: Algorithms - Sorting
Suppose there are 4 sorted list of 16 elements each. If we merge these lists into a single sorted list of 64 elements. The key comparisons that are needed in the worst case using an efficient algorithm are
User Avatar
659
views
0 answers
0 votes
MadeEasy Test Series: Algorithms - Sorting
Which of the following sorting algorithm represented by above code?
User Avatar
5.7k
views
1 answers
2 votes
bubble sort
How many passes of bubble sort are required to sort the following sequence (Pass is counted only when at least one swap is performed in the bubble sort pass)? ... (d) 3I am getting ans as 3 but given answer in 4. please verify it
User Avatar
4.7k
views
1 answers
0 votes
MadeEasy Subject Test 2019: Algorithms - Sorting
Which of the following input will give best case time for selection sort?(A) 1 2 3 4 5 6 7 8 9 10(B) 2 3 1 5 9 7 8 6 10(C) 10 9 8 7 6 5 4 3 2 1 (D) All of above take same amount of time
User Avatar
894
views
1 answers
2 votes
MadeEasy Test Series: Algorithms - Sorting
An array of size n is known to be sorted except for the 1st k elements and the last k elements, where k is a constant. which of the following algorithm is the best ... in average case and O(k^2) in the worst case. what's wrong in that?
User Avatar
339
views
0 answers
0 votes
Self doubt
The tightest lower bound on the number of comparisons, in the worst case, for comparison-based sorting is The tightest upper bound on the number of comparisons ... the number of comparisons, in the best case, for comparison-based sorting is
User Avatar
561
views
0 answers
0 votes
made_easy_test_2019 (Algorithms)
explain how to solve the above question !
User Avatar
325
views
1 answers
0 votes
Ace test series
User Avatar
17.1k
views
1 answers
1 votes
NIELIT 2018-47
______ sorting algorithms has the lowest worst-case complexity.Selection SortBubble SortMerge SortQuick Sort
User Avatar
1.2k
views
2 answers
1 votes
GATE CSE 2003 | Question: 22 Self doubt
The unusual $\Theta(n^2)$ implementation of Insertion Sort to sort an array uses linear search to identify the position where an element is to be inserted ... what the binary search will be performed for every element. Can someone confirm?
User Avatar
5.2k
views
2 answers
1 votes
Adaptive sorting Algorithm.
Is Quick sort an adaptive sorting Algorithm? I think no. Because as per the definition given in the Wikipedia is that A adaptive sorting Algorithm is one who ... preorderedness of the input. But in case of Quick sort it act as disadvantage.
User Avatar
Page: