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
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 Correct Answer <p>none of the above</p>
n/2, the worst case should be the one where all positive numbers occur before the negative ones.
মোঃ আরিফুল ইসলাম
Feb 20, 2025