in Algorithms
146 views
0 votes
0 votes

Which of the following is true with respect to the rank of the element ?

(a) Worst case occur when pivot partitions the array in 0, n-1

(b) When pivot partitions the array in size n/2, n/2, the time complexity is O(n)

(c) When pivot partitions the array in 3n/7, 4n/7, the time complexity is O(n)

(d) Rank of 6 in array [1,2,6,4,9,10,-1,0] is 7 

 

Options are:

  1. a,b,c
  2. all of the above
  3. a,c
  4. only a
in Algorithms
146 views

2 Comments

Answer: 4
0
0
Ans is 1 but why b c ?
0
0

Please log in or register to answer this question.

Related questions