Quick Sort as Divide and Conquer in DSA C# - Cheat Sheet & Quick Revision

Recall & Review

beginner

What is the main idea behind Quick Sort as a divide and conquer algorithm?

Quick Sort divides the array into smaller parts around a pivot, sorts each part independently, and then combines them to get the sorted array.

beginner

What role does the pivot play in Quick Sort?

The pivot is the element used to split the array into two parts: elements less than the pivot go to one side, and elements greater go to the other side.

beginner

Explain the three main steps of Quick Sort.

1. Choose a pivot.
2. Partition the array around the pivot.
3. Recursively apply Quick Sort to the left and right parts.

intermediate

Why is Quick Sort considered efficient on average?

Because it divides the problem into smaller parts quickly and sorts them independently, leading to an average time complexity of O(n log n).

intermediate

What happens in Quick Sort if the pivot is always the smallest or largest element?

The array is divided unevenly, causing the worst-case time complexity of O(n²), making Quick Sort slower.

In Quick Sort, what is the purpose of the partition step?

A To merge two sorted arrays

B To reverse the array

C To find the maximum element in the array

D To rearrange elements so those less than the pivot come before it and those greater come after

Partitioning rearranges the array around the pivot so smaller elements are on one side and larger on the other.

What is the average time complexity of Quick Sort?

A O(n log n)

B O(n²)

C O(log n)

D O(n)

Quick Sort has an average time complexity of O(n log n) due to its divide and conquer approach.

Which of these is NOT a step in Quick Sort?

A Choosing a pivot

B Partitioning the array

C Merging sorted arrays

D Recursively sorting subarrays

Quick Sort does not merge arrays; merging is part of Merge Sort.

What can cause Quick Sort to perform poorly?

A Choosing the middle element as pivot

B Choosing the smallest or largest element as pivot repeatedly

C Using recursion

D Sorting an already sorted array

Picking the smallest or largest element as pivot causes unbalanced partitions and worst-case O(n²) time.

Quick Sort is an example of which algorithm design technique?

A Divide and Conquer

B Greedy Algorithm

C Dynamic Programming

D Backtracking

Quick Sort uses divide and conquer by splitting the problem into smaller parts and solving them independently.

Describe how Quick Sort uses divide and conquer to sort an array.

Think about splitting the array and sorting smaller parts.

Explain why the choice of pivot affects Quick Sort's performance.

Consider how uneven splits slow down sorting.

Practice

1. What is the main idea behind the Quick Sort algorithm in the divide and conquer approach?

easy

A. Use extra memory to merge two sorted arrays

B. Sort the array by repeatedly swapping adjacent elements

C. Divide the array into smaller parts, sort them, and combine results

D. Sort elements by counting their frequency

Solution

1. Step 1: Understand divide and conquer in Quick Sort

   Quick Sort divides the array into smaller parts using a pivot, then sorts each part separately.

2. Step 2: Compare with other sorting methods

   Unlike bubble sort or counting sort, Quick Sort uses division and conquering subproblems.

3. Final Answer:

   Divide the array into smaller parts, sort them, and combine results -> Option C

4. Quick Check:

   Divide and conquer = splitting and sorting parts [OK]

Hint: Remember: Quick Sort splits and sorts parts separately [OK]

Common Mistakes:

• Confusing Quick Sort with bubble sort
• Thinking Quick Sort uses extra memory like merge sort
• Believing Quick Sort counts frequencies

2. Which of the following is the correct way to declare the partition method header in C# for Quick Sort?

easy

A. public static int Partition(int[] arr, int low, int high)

B. void Partition(int arr[], int low, int high)

C. int Partition(int[] arr, int low, int high, int pivot)

D. public int Partition(int arr, int low, int high)

Solution

1. Step 1: Check C# method declaration syntax

   In C#, arrays are declared as int[] arr, and method must specify return type and access modifier.

2. Step 2: Validate parameters and return type

   Partition returns an integer index, so return type is int. Parameters include array and two indices.

3. Final Answer:

   public static int Partition(int[] arr, int low, int high) -> Option A

4. Quick Check:

   C# method syntax with array and return int = public static int Partition(int[] arr, int low, int high) [OK]

Hint: Remember C# arrays use [] after type, method needs return type [OK]

Common Mistakes:

• Using C-style array syntax like int arr[]
• Missing return type or access modifier
• Passing pivot as parameter unnecessarily

3. What will be the output array after applying Quick Sort on int[] arr = {4, 2, 7, 1}?

medium

A. [1, 2, 4, 7]

B. [7, 4, 2, 1]

C. [2, 1, 4, 7]

D. [4, 7, 2, 1]

Solution

1. Step 1: Apply Quick Sort partition and recursive calls

   Pivot chosen (commonly last element 1), partition places 1 at start, then sort left and right parts recursively.

2. Step 2: Sort remaining parts

   After partitioning and recursive sorting, array becomes sorted ascending: 1, 2, 4, 7.

3. Final Answer:

   [1, 2, 4, 7] -> Option A

4. Quick Check:

   Sorted array ascending = [1, 2, 4, 7] [OK]

Hint: Quick Sort outputs sorted array ascending by default [OK]

Common Mistakes:

• Confusing pivot placement
• Not sorting both sides recursively
• Assuming output is reversed

4. Identify the error in this Quick Sort partition code snippet:

int Partition(int[] arr, int low, int high) {
  int pivot = arr[high];
  int i = low;
  for (int j = low; j < high; j++) {
    if (arr[j] < pivot) {
      Swap(arr[i], arr[j]);
      i++;
    }
  }
  Swap(arr[i], arr[high]);
  return i;
}

medium

A. The initial value of i should be low - 1

B. Swap method is called with values, not indices

C. The loop should run until j <= high

D. Pivot should be arr[low], not arr[high]

Solution

1. Step 1: Analyze Swap usage in C#

   Swap is called with arr[i] and arr[j], which passes values, not array indices, so original array won't change.

2. Step 2: Correct Swap call

   Swap should be called with indices or use a method that swaps elements in the array by index.

3. Final Answer:

   Swap method is called with values, not indices -> Option B

4. Quick Check:

   Swap needs indices or ref to swap array elements [OK]

Hint: Swap array elements by indices, not by passing values [OK]

Common Mistakes:

• Using wrong loop range
• Incorrect pivot choice
• Initializing i incorrectly

5. Given an array int[] arr = {3, 6, 8, 10, 1, 2, 1}, how many recursive calls will Quick Sort make to fully sort this array using the last element as pivot each time?

hard

A. 7

B. 15

C. 13

D. 9

Solution

1. Step 1: Understand recursive calls in Quick Sort

   Each partition divides array into two parts; recursive calls happen on both sides unless base case reached.

2. Step 2: Trace recursive calls for given array

   Initial call on 7 elements, partitions and recurses on subarrays. Counting calls: initial + left + right calls totals 9.

3. Final Answer:

   9 -> Option D

4. Quick Check:

   Counting recursive calls carefully = 9 [OK]

Hint: Count initial call plus calls on subarrays after partition [OK]

Common Mistakes:

• Counting only partition steps, not recursive calls
• Assuming calls equal array length
• Ignoring base case stops