Shell Sort Algorithm in DSA Java - Build from Scratch

Shell Sort Algorithm

📖 Scenario: You work in a warehouse where boxes are arranged in a row with different weights. You want to sort these boxes by weight from lightest to heaviest to make loading easier.

🎯 Goal: Build a Java program that uses the Shell Sort Algorithm to sort an array of box weights in ascending order.

📋 What You'll Learn

Create an integer array called weights with the exact values: 23, 12, 45, 7, 19, 34, 56

Create an integer variable called n that stores the length of the weights array

Implement the Shell Sort algorithm using a while loop to reduce the gap and nested for loops to sort elements

Print the sorted array in the format: 7 12 19 23 34 45 56

💡 Why This Matters

🌍 Real World

Sorting items quickly helps warehouses organize products for faster shipping and inventory management.

💼 Career

Understanding sorting algorithms like Shell Sort is important for software developers working on performance-critical applications.

1

Create the array of box weights

Create an integer array called weights with these exact values: 23, 12, 45, 7, 19, 34, 56

DSA Java

// Create the array weights with the given values
// Your code here

Hint

Use int[] weights = {23, 12, 45, 7, 19, 34, 56}; to create the array.

2

Create a variable for the array length

Create an integer variable called n that stores the length of the weights array

DSA Java

public class ShellSort {
    public static void main(String[] args) {
        int[] weights = {23, 12, 45, 7, 19, 34, 56};
        // Create variable n to store length of weights
        // Your code here
    }
}

Hint

Use int n = weights.length; to get the array length.

3

Implement the Shell Sort algorithm

Implement the Shell Sort algorithm using a while loop to reduce the gap starting from n/2, and nested for loops to sort elements by comparing and swapping in the weights array

DSA Java

public class ShellSort {
    public static void main(String[] args) {
        int[] weights = {23, 12, 45, 7, 19, 34, 56};
        int n = weights.length;
        // Implement Shell Sort algorithm below
        // Your code here
    }
}

Hint

Start gap as n / 2. Use a while loop to reduce gap by half each time. Use nested loops to compare and shift elements.

4

Print the sorted array

Print the sorted weights array elements separated by spaces in one line

DSA Java

public class ShellSort {
    public static void main(String[] args) {
        int[] weights = {23, 12, 45, 7, 19, 34, 56};
        int n = weights.length;

        int gap = n / 2;
        while (gap > 0) {
            for (int i = gap; i = gap && weights[j - gap] > temp) {
                    weights[j] = weights[j - gap];
                    j -= gap;
                }
                weights[j] = temp;
            }
            gap /= 2;
        }
        // Print sorted array below
        // Your code here
    }
}

Hint

Use a for loop to print each element followed by a space.

Practice

1. What is the main idea behind the Shell Sort algorithm?

easy

A. It sorts elements by comparing distant elements and gradually reducing the gap.

B. It sorts elements by repeatedly swapping adjacent elements only.

C. It uses a divide and conquer approach to sort subarrays independently.

D. It builds a sorted list by inserting elements one by one in order.

Solution

1. Step 1: Understand Shell Sort concept

   Shell Sort improves insertion sort by comparing elements far apart, reducing the gap over iterations.

2. Step 2: Compare options with concept

   It sorts elements by comparing distant elements and gradually reducing the gap. correctly describes this gap reduction and distant element comparison. Others describe different sorting methods.

3. Final Answer:

   It sorts elements by comparing distant elements and gradually reducing the gap. -> Option A

4. Quick Check:

   Shell Sort = gap reduction and distant comparisons [OK]

Hint: Shell Sort uses gaps to compare distant elements first [OK]

Common Mistakes:

• Confusing Shell Sort with Bubble Sort
• Thinking it only swaps adjacent elements
• Mixing it up with Merge Sort or Insertion Sort

2. Which of the following is the correct way to initialize the gap variable in Shell Sort in Java?

easy

A. int gap = arr.length / 2;

B. int gap = arr.length * 2;

C. int gap = arr.length + 1;

D. int gap = 0;

Solution

1. Step 1: Understand gap initialization

   Shell Sort starts with a gap usually half the array length to compare distant elements.

2. Step 2: Check options for correct initialization

   int gap = arr.length / 2; correctly sets gap to half the array length. Others are incorrect or ineffective.

3. Final Answer:

   int gap = arr.length / 2; -> Option A

4. Quick Check:

   Gap starts at half array length [OK]

Hint: Start gap at half array length for Shell Sort [OK]

Common Mistakes:

• Setting gap larger than array length
• Starting gap at zero causing no sorting
• Using gap as array length plus one

3. What will be the output array after applying Shell Sort on int[] arr = {9, 8, 3, 7, 5, 6, 4, 1};?

medium

A. [3, 1, 4, 5, 6, 7, 8, 9]

B. [9, 8, 7, 6, 5, 4, 3, 1]

C. [1, 4, 3, 5, 6, 7, 8, 9]

D. [1, 3, 4, 5, 6, 7, 8, 9]

Solution

1. Step 1: Apply Shell Sort on given array

   Start with gap = 4 (8/2), compare and swap distant elements, then reduce gap to 2, then 1, sorting progressively.

2. Step 2: Final sorted array

   After all gap reductions and swaps, the array becomes fully sorted: [1, 3, 4, 5, 6, 7, 8, 9].

3. Final Answer:

   [1, 3, 4, 5, 6, 7, 8, 9] -> Option D

4. Quick Check:

   Shell Sort fully sorts array ascending [OK]

Hint: Shell Sort outputs fully sorted array ascending [OK]

Common Mistakes:

• Confusing partial sorted states as final output
• Ignoring gap reductions
• Assuming reverse order output

4. Identify the error in this Shell Sort snippet:

for (int gap = arr.length / 2; gap > 0; gap /= 2) {
  for (int i = gap; i < arr.length; i++) {
    int temp = arr[i];
    int j = i;
    while (j >= gap && arr[j - gap] > temp) {
      arr[j] = arr[j - gap];
      j -= gap;
    }
    arr[j] = temp;
  }
}

medium

A. The gap update should be gap = gap / 3, not gap /= 2.

B. The inner while loop condition should be j > gap, not j >= gap.

C. No error; the code correctly implements Shell Sort.

D. The variable temp should be declared outside the loops.

Solution

1. Step 1: Analyze the loop and conditions

   The gap starts at half array length and halves each iteration, which is a common Shell Sort approach.

2. Step 2: Check inner loop and assignments

   The inner while loop correctly shifts elements greater than temp, and temp is assigned properly after shifting.

3. Final Answer:

   No error; the code correctly implements Shell Sort. -> Option C

4. Quick Check:

   Code matches standard Shell Sort logic [OK]

Hint: Check loop conditions and assignments carefully [OK]

Common Mistakes:

• Changing gap update incorrectly
• Misusing loop conditions causing index errors
• Declaring variables in wrong scope

5. Given an array int[] arr = {20, 35, -15, 7, 55, 1, -22};, how many times will the inner while loop execute during the first gap iteration in Shell Sort?

hard

A. 5 times

B. 3 times

C. 7 times

D. 9 times

Solution

1. Step 1: Determine initial gap

   Array length 7, gap = 3. Process i from 3 to 6.

2. Step 2: Count inner while loop executions (shifts)

   Initial: [20,35,-15,7,55,1,-22]
   - i=3, temp=7 vs arr[0]=20: 1 shift -> [7,35,-15,20,55,1,-22]
   - i=4, temp=55 vs arr[1]=35: 0 shifts (35 < 55)
   - i=5, temp=1 vs arr[2]=-15: 0 shifts (-15 < 1)
   - i=6, temp=-22 vs arr[3]=20 then arr[0]=7: 2 shifts
   Total: 1+0+0+2 = 3.

3. Final Answer:

   3 times -> Option B

4. Quick Check:

   Shifts first gap = 3 [OK]

Hint: Count shifts for each gap iteration carefully [OK]

Common Mistakes:

• Counting only comparisons, not shifts
• Ignoring multiple shifts per element
• Miscalculating gap or indices