recategorized by
659 views
0 votes
0 votes

 

Which of the following sorting algorithm represented by above code?

recategorized by

Please log in or register to answer this question.

Related questions

1.6k
views
4 answers
3 votes
newdreamz a1-z0 asked Jan 21, 2019
1,625 views
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)
894
views
1 answers
2 votes
aambazinga asked Dec 15, 2018
894 views
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?
1.7k
views
2 answers
0 votes
Somoshree Datta 5 asked Oct 20, 2018
1,720 views
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______?
1.4k
views
0 answers
1 votes
Na462 asked Apr 30, 2018
1,443 views
Please Justify Statements which are true and which are false by an Example:Consider the following statements :S1 :While performing quick sort at any iteration only ... source shortest path problem on G'.Which of the following is correct ?