Shell Sort Algorithm in DSA C++ - Build from Scratch

Shell Sort Algorithm

📖 Scenario: You are working on a program that needs to sort a list of numbers efficiently. Shell Sort is a sorting technique that improves on simple sorting methods by comparing elements far apart and gradually reducing the gap between elements to be compared.Imagine you have a messy stack of numbered cards, and you want to arrange them in order. Instead of sorting one card at a time, you first compare cards far apart, then closer, until everything is sorted.

🎯 Goal: Build a C++ program that sorts an array of integers using the Shell Sort algorithm. You will create the array, set the initial gap, implement the sorting logic, and finally print the sorted array.

📋 What You'll Learn

Create an integer array with exact values: 23, 12, 1, 8, 34, 54, 2, 3

Create an integer variable n to store the size of the array

Create an integer variable gap initialized to half of n

Implement the Shell Sort algorithm using a while loop that reduces gap until it becomes 0

Use nested for and while loops to perform insertion sort on elements separated by gap

Print the sorted array elements separated by spaces

💡 Why This Matters

🌍 Real World

Shell Sort is useful in systems where simple sorting algorithms are too slow but full quicksort is too complex. It is often used in embedded systems or small datasets.

💼 Career

Understanding Shell Sort helps in grasping how sorting algorithms optimize comparisons and swaps, a key skill in software development and technical interviews.

1

Create the array and its size

Create an integer array called arr with these exact values: 23, 12, 1, 8, 34, 54, 2, 3. Then create an integer variable called n and set it to the size of arr.

DSA C++

int arr[] = {23, 12, 1, 8, 34, 54, 2, 3};
// Your code here

Hint

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

2

Set the initial gap for Shell Sort

Create an integer variable called gap and set it to half of n.

DSA C++

int arr[] = {23, 12, 1, 8, 34, 54, 2, 3};
int n = sizeof(arr) / sizeof(arr[0]);
// Your code here

Hint

The gap starts as half the size of the array.

3

Implement the Shell Sort algorithm

Use a while loop that runs while gap is greater than 0. Inside it, use a for loop with variable i from gap to n. Then use a while loop with variable j to perform insertion sort on elements separated by gap. Decrease gap by half at the end of each while loop iteration.

DSA C++

int arr[] = {23, 12, 1, 8, 34, 54, 2, 3};
int n = sizeof(arr) / sizeof(arr[0]);
int gap = n / 2;
// Your code here

Hint

Shell Sort uses a gap to compare and sort elements far apart, then reduces the gap gradually.

4

Print the sorted array

Use a for loop with variable i from 0 to n to print each element of arr separated by spaces.

DSA C++

int arr[] = {23, 12, 1, 8, 34, 54, 2, 3};
int n = sizeof(arr) / sizeof(arr[0]);
int gap = n / 2;

while (gap > 0) {
    for (int i = gap; i = gap && arr[j - gap] > temp) {
            arr[j] = arr[j - gap];
            j -= gap;
        }
        arr[j] = temp;
    }
    gap /= 2;
}
// Your code here

Hint

Print each element followed by a space. Use std::cout and end with std::endl.