Suppose we want to arrange the n numbers stored in an array such that all…
PYQ GATE 1999
Suppose we want to arrange the n numbers stored in an array such that all negative values occur before all positive ones. Minimum number of exchanges required in the worst case is:
- A.
n - 1
- B.
n
- C.
n + 1
- D.
None of the above
Attempted by 546 students.
Sign up free to check your answer
Sign up freeLoading lesson…