Data Structure › Array MCQ › Question #2711
MCQ Single Best Answer 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,853 views
Question Info
#2711Q ID
Not SetDifficulty
Array MCQTopic
Start Quiz on This Topic
 Your Answer

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: Option A

Explanation

n-1
 Continue Practice
Previous Question Next Question
 Share

Share This Question

Challenge a friend or share with your study group.

 More from This Topic

Related MCQ Questions

If an array is declared as int arr[5][5] , how many elements can it store? If an array is declared as arr[] = {1,3,5,7,9}; then what is the value of sizeof(arr[3]) ? A data structure that can store related information of different data types together is called Given an integer array arr[] ; the i th element can be accessed by writing How array values can be held by an array defined as A(-1.....n, 1 Memory for a structure is allocated at the time of If an array is declared as double arr[50]; how many bytes will be allocated to it? If an array is declared as int arr[50] , how many elements can it hold? If int s[s] is a one-dimensional array of integers, which of the following refers to the third element of in t If an array is declared as arr[] = {1,3,5,7,9}; then what is the value of arr[3] ?