Register

Search results for selection-sort

0 votes
2 answers
2
MadeEasy Subject Test: Algorithms - Sorting
a. i>0,K>0, a[K]> a[max] b. i>0,K<0, a[K]< a[max] c. i<0,K>0, a[K]> a[max] d. i>0,K>0, a[K]< a[max]
a. i>0,K>0, a[K] a[max]b. i>0,K<0, a[K]< a[max]c. i<0,K>0, a[K] a[max]d. i>0,K>0, a[K]< a[max]
User Avatar
7 votes
3 answers
3
ISRO2008-77
How many comparisons are needed to sort an array of length $5$ if a straight selection sort is used and array is already in the opposite order? $1$ $10$ $15$ $20$
How many comparisons are needed to sort an array of length $5$ if a straight selection sort is used and array is already in the opposite order?$1$$10$$15$$20$
User Avatar
1 votes
1 answer
4
NPTEL MOOC
Why option (A) is not correct ?
Why option (A) is not correct ?
User Avatar
To see more, click for the full list of questions or popular tags.