Quick sort algorithm is an example of

2023

Quick sort algorithm is an example of

Answer: D. Divide and conquer — Answer : D Explanation Quick sort divides the list using pivot and then sorts in recursive manner. It uses divide and conquer approach.

  1. A.

    Greedy approach

  2. B.

    Improved binary search

  3. C.

    Dynamic Programming

  4. D.

    Divide and conquer

Attempted by 664 students.

Show answer & explanation

Correct answer: D

Answer : D

Explanation

Quick sort divides the list using pivot and then sorts in recursive manner. It uses divide and conquer approach.

Explore the full course: Coding For Placement

Loading lesson…