PA of Algorithms Q93

93Suppose 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

Option : D
Explanation :
When we have ‘n’ numbers stored in an array, we have to swap all positive number with negative number so in worst case positive numbers will be n/2,

Forgot your password?

I agree with the Terms.