campus placement AMCAT Mock Test Algorithms Asymptotic Worst Case Time and Time Complexity Asymptotic Notations
Suppose we want to arrange the n numbers stored in any array such that all negative values occur before all positive ones. Minimum number of exchanges required in the worst case is
1
n - 1
2
n
3
n + 1
4
none of the above