Single Choice Not Set

QSuppose we want to arrange n numbers stored in an array such that all negative values occur such before all positive ones. Minimum number of exchange required in the worst case

ID: #2711 Array MCQ 2,898 views
Question Info
#2711Q ID
Not SetDifficulty
Array MCQTopic

Choose the Best Option

Click any option to instantly check if you're correct.

  • A n-1 ✔ ✖
  • B n ✔ ✖
  • C n+1 ✔ ✖
  • D none of the above ✔ ✖
Correct Answer

Explanation

n-1
Today: 0 answered · 0 correct
Save progress
Free account

Want to remember what you got wrong?

Create a free account in seconds to track your score, revisit mistakes and continue Computer Science and Engineering where you left off.

  • Save your progress & streak
  • Topic-wise quizzes & scores
  • Bookmark tricky questions
  • Printable MCQ sets
Practice smarterFree account · save progress
Sign up free

Share This Question

Challenge a friend or share with your study group.