GATE | GATE CS 1999 | Question 13

Last Updated :

Discuss

Comments

Suppose we want to arrange the ii 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:

n-1

n

n+1

None of the above

This question is part of this quiz :

Top MCQs on Complexity Analysis of Algorithms with Answers,GATE CS 1999

Tags:

Share your thoughts in the comments

author

GeeksforGeeks