recategorized by
972 views
0 0 votes

 

Which of the following sorting algorithm represented by above code?

Please log in or register to answer this question.

Position:
Show:

Related questions

3 3 votes
4 4 answers
2.5k
2.5k views
newdreamz a1-z0 asked Jan 21, 2019
2,473 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 se...
4 4 votes
4 answers 4 answers
4.8k
4.8k views
Ramij asked Dec 20, 2018
4,826 views
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 ca...
0 0 votes
1 1 answer
5.1k
5.1k views
Rajat Agrawal007 asked Dec 17, 2018
5,132 views
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...
2 2 votes
1 1 answer
1.5k
1.5k views
aambazinga asked Dec 15, 2018
1,501 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 choice...