Q. How many sub arrays does the quick sort algorithm divide the entire array into?

  • (A) one
  • (B) two
  • (C) three
  • (D) four
πŸ’¬ Discuss
βœ… Correct Answer: (B) two
Explanation: the entire array is divided into two partitions, 1st sub array containing elements less than the pivot element and 2nd sub array containing elements greater than the pivot element.

Published by Mr. Dubey ⭐ 111.42K Points at 16-Sep-2023 03:43 pm in Design and Analysis of Algorithms

Explanation by: Mr. Dubey
the entire array is divided into two partitions, 1st sub array containing elements less than the pivot element and 2nd sub array containing elements greater than the pivot element.

πŸ’¬ Discussion

Related MCQs

Q. Which of the following are NOT Relational operators in C#.NET? 1.>= 2.!= 3.Not 4.<= 5.<>=

Q. Which of the following is not a limitation of view?

Q. LCD uses

Q. Class diagrams are not useful to ________

Q. access time is also known as

Q. Which device can understand difference between data & programs?

Q. #include<iostream> using namespace std; class Point { public: Point() { cout << "Constructor called"; } }; int main() { Point t1

Q. In Evolutionary strategy, recombination is

Q. Which of the following is an application of stack?

Q. dual of (p V q)Ω¨ r is..

πŸ“Š Question Analytics

πŸ‘οΈ
760
Total Visits
πŸ“½οΈ
3 y ago
Published
πŸŽ–οΈ
Mr. Dubey
Publisher
πŸ“ˆ
89%
Success Rate