Which of the following algorithm design techniques is used in the quick sort algorithm?

This question was previously asked in
ESE Electronics 2014 Paper 2: Official Paper
View all UPSC IES Papers >
  1. Dynamic programming
  2. Backtracking
  3. Divide and conquer
  4. Greedy method

Answer (Detailed Solution Below)

Option 3 : Divide and conquer
Free
ST 1: UPSC ESE (IES) Civil - Building Materials
6.4 K Users
20 Questions 40 Marks 24 Mins

Detailed Solution

Download Solution PDF

Concept:

Quick Sort is a Divide and Conquer algorithm. It picks an element as a pivot and partitions the given array.

Important Points:

  • Merge Sort is a Divide and Conquer algorithm. It divides the input array into two halves, calls itself for the two halves, and then merges the two sorted halves.
  • Both Merge Sort and quicksort are based on the divide and conquer method.
Latest UPSC IES Updates

Last updated on Jul 2, 2025

-> ESE Mains 2025 exam date has been released. As per the schedule, UPSC IES Mains exam 2025 will be conducted on August 10. 

-> UPSC ESE result 2025 has been released. Candidates can download the ESE prelims result PDF from here.

->  UPSC ESE admit card 2025 for the prelims exam has been released. 

-> The UPSC IES Prelims 2025 will be held on 8th June 2025.

-> The selection process includes a Prelims and a Mains Examination, followed by a Personality Test/Interview.

-> Candidates should attempt the UPSC IES mock tests to increase their efficiency. The UPSC IES previous year papers can be downloaded here.

More Divide and Conquer Questions

More Algorithm Design Techniques Questions

Get Free Access Now
Hot Links: teen patti cash game teen patti bliss teen patti apk