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

M

Mr. Dubey

🎓 Coach ⭐ 103.11K Points

📊 Design and Analysis of Algorithms

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.

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

📊 Question Analytics

👁️

729

Total Visits

📽️

2 y ago

Published

🎖️

Mr. Dubey

Publisher

📈

91%

Success Rate