Quick Sort as Divide and Conquer in DSA C - Build from Scratch

Quick Sort as Divide and Conquer

📖 Scenario: You are working on a program that sorts a list of numbers quickly. Sorting helps organize data so you can find things faster, like arranging books by title on a shelf.

🎯 Goal: Build a program that uses the Quick Sort method to sort an array of integers in ascending order. Quick Sort works by dividing the list into smaller parts, sorting those parts, and then combining them.

📋 What You'll Learn

Create an integer array with exact values

Define a pivot index variable

Implement the partition function to divide the array

Implement the quickSort function using divide and conquer

Print the sorted array in the final step

💡 Why This Matters

🌍 Real World

Quick Sort is used in many software systems to organize data quickly, such as sorting search results or arranging files.

💼 Career

Understanding Quick Sort helps in coding interviews and building efficient programs that handle large data sets.

1

Create the integer array

Create an integer array called arr with these exact values: 29, 10, 14, 37, 13 and an integer n set to the size of arr.

DSA C

int arr[] = {29, 10, 14, 37, 13};
int n = sizeof(arr) / sizeof(arr[0]);
// Your code here

Hint

Use sizeof(arr) / sizeof(arr[0]) to get the number of elements in the array.

2

Define the pivot index and partition function

Define an integer variable pivot inside the partition function. Write the partition function that takes the array arr, low, and high indexes, uses the last element as pivot, and partitions the array so that elements less than pivot come before it and greater come after.

DSA C

int partition(int arr[], int low, int high) {
    int pivot = arr[high];
    int i = (low - 1);
    // Your code here
}

Hint

The pivot is the last element arr[high]. Use a loop from low to high - 1 to compare elements with pivot.

3

Implement the quickSort function

Write the quickSort function that takes the array arr, low, and high indexes. Use divide and conquer by calling partition to get the pivot index, then recursively call quickSort on the left and right parts of the array.

DSA C

void quickSort(int arr[], int low, int high) {
    if (low < high) {
        int pi = partition(arr, low, high);
        // Your code here
    }
}

Hint

Use recursion to sort the parts before and after the pivot index returned by partition.

4

Print the sorted array

Call quickSort with arr, 0, and n - 1. Then print the sorted array elements separated by spaces on one line.

DSA C

int main() {
    quickSort(arr, 0, n - 1);
    // Print the sorted array
    // Your code here
    return 0;
}

Hint

Call quickSort(arr, 0, n - 1) and then use a for loop to print each element with printf.

Practice

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

easy

A. Compare each element with every other element to sort

B. Divide the array into smaller parts using a pivot and sort them recursively

C. Merge two sorted arrays into one sorted array

D. Insert elements one by one into the correct position

Solution

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

   Quick Sort picks a pivot and divides the array into parts smaller and larger than the pivot.

2. Step 2: Recursive sorting of parts

   It then sorts these parts recursively, combining results to get a sorted array.

3. Final Answer:

   Divide the array into smaller parts using a pivot and sort them recursively -> Option B

4. Quick Check:

   Quick Sort = Divide and conquer with pivot [OK]

Hint: Remember pivot splits array for recursive sorting [OK]

Common Mistakes:

• Confusing Quick Sort with Merge Sort
• Thinking Quick Sort compares all pairs
• Believing Quick Sort inserts elements one by one

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

easy

A. 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);

D. int partition(int arr[], int low);

Solution

1. Step 1: Check parameter types for partition

   The partition function takes an array and two indices low and high to work on a subarray.

2. Step 2: Check return type

   It returns an integer index where the pivot ends after partitioning.

3. Final Answer:

   int partition(int arr[], int low, int high); -> Option A

4. Quick Check:

   Partition returns pivot index with array and bounds [OK]

Hint: Partition returns pivot index, needs array and bounds [OK]

Common Mistakes:

• Using void return type instead of int
• Passing array as int instead of int[]
• Missing one of the index parameters

3. What will be the output array after calling Quick Sort on arr = {3, 6, 8, 10, 1, 2, 1}?

medium

A. [1, 1, 2, 3, 6, 8, 10]

B. [3, 6, 8, 10, 1, 2, 1]

C. [10, 8, 6, 3, 2, 1, 1]

D. [1, 2, 1, 3, 6, 8, 10]

Solution

1. Step 1: Apply Quick Sort to the array

   Quick Sort rearranges elements so smaller come before pivot and larger after, recursively sorting subarrays.

2. Step 2: Sort the given array

   Sorting {3,6,8,10,1,2,1} results in {1,1,2,3,6,8,10} in ascending order.

3. Final Answer:

   [1, 1, 2, 3, 6, 8, 10] -> Option A

4. Quick Check:

   Sorted array = ascending order [OK]

Hint: Quick Sort outputs sorted array ascending [OK]

Common Mistakes:

• Assuming original array stays same
• Confusing ascending with descending order
• Misplacing duplicate elements

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) {
      i++;
      swap(&arr[i], &arr[j]);
    }
  }
  swap(&arr[i + 1], &arr[high]);
  return i + 1;
}

medium

A. For loop should run until j <= high

B. Pivot should be arr[low] instead of arr[high]

C. Swap should be called outside the loop only

D. Variable i should start at low - 1

Solution

1. Step 1: Check initialization of i

   In partition, i should start at low - 1 to correctly track smaller elements before j.

2. Step 2: Analyze loop and swaps

   Starting i at low causes incorrect swaps and wrong pivot placement.

3. Final Answer:

   Variable i should start at low - 1 -> Option D

4. Quick Check:

   i = low - 1 fixes partition indexing [OK]

Hint: Initialize i to low - 1 before loop [OK]

Common Mistakes:

• Starting i at low causes off-by-one errors
• Changing pivot position incorrectly
• Loop running beyond high index

5. Given an array with many duplicate elements, which modification to Quick Sort helps improve performance?

hard

A. Avoid recursion and use iterative sorting only

B. Always pick the first element as pivot

C. Use a three-way partitioning to separate less, equal, and greater elements

D. Skip sorting duplicates to save time

Solution

1. Step 1: Understand problem with duplicates in Quick Sort

   Duplicates cause many equal elements to be repeatedly partitioned, slowing sorting.

2. Step 2: Apply three-way partitioning

   Three-way partitioning divides array into less than, equal to, and greater than pivot, reducing redundant work.

3. Final Answer:

   Use a three-way partitioning to separate less, equal, and greater elements -> Option C

4. Quick Check:

   Three-way partitioning optimizes duplicates [OK]

Hint: Three-way partition handles duplicates efficiently [OK]

Common Mistakes:

• Picking fixed pivot causes worst-case time
• Skipping duplicates breaks sorting correctness
• Avoiding recursion does not fix duplicate issue