Shell Sort Algorithm in DSA Go - 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 by comparing elements far apart and gradually reducing the gap.Imagine you have a messy stack of books with different thicknesses, and you want to arrange them from thinnest to thickest quickly by comparing books that are far apart first, then closer and closer.

🎯 Goal: Build a Go program that sorts a slice of integers using the Shell Sort algorithm step-by-step.

📋 What You'll Learn

Create a slice of integers with exact values

Define a gap variable for the Shell Sort

Implement the Shell Sort logic using nested loops

Print the sorted slice at the end

💡 Why This Matters

🌍 Real World

Shell Sort is useful for sorting medium-sized lists efficiently in systems where simple sorting is too slow but full advanced algorithms are not needed.

💼 Career

Understanding Shell Sort helps in grasping sorting algorithm concepts and improving problem-solving skills for coding interviews and software development.

1

Create the initial slice of integers

Create a slice called numbers with these exact integers in order: 23, 12, 1, 8, 34, 54, 2, 3

DSA Go

// Create the slice called numbers with the exact integers
// Your code here

Hint

Use numbers := []int{23, 12, 1, 8, 34, 54, 2, 3} to create the slice.

2

Set the initial gap for Shell Sort

Add a variable called gap and set it to half the length of numbers using len(numbers) / 2

DSA Go

package main

import "fmt"

func main() {
    numbers := []int{23, 12, 1, 8, 34, 54, 2, 3}
    // Set the initial gap
    // Your code here
}

Hint

Use gap := len(numbers) / 2 to start the gap.

3

Implement the Shell Sort core logic

Write a for loop that runs while gap > 0. Inside it, write a for loop with i := gap to i < len(numbers). Inside that, set temp := numbers[i] and j := i. Then use a for loop to shift elements while j >= gap and numbers[j - gap] > temp. After shifting, set numbers[j] = temp. Finally, reduce gap by half at the end of the outer loop.

DSA Go

package main

import "fmt"

func main() {
    numbers := []int{23, 12, 1, 8, 34, 54, 2, 3}
    gap := len(numbers) / 2

    // Implement Shell Sort loops here
    // Your code here
}

Hint

Use nested loops to compare and shift elements based on the gap, then reduce the gap each time.

4

Print the sorted slice

Add a fmt.Println(numbers) statement after the sorting loops to print the sorted slice.

DSA Go

package main

import "fmt"

func main() {
    numbers := []int{23, 12, 1, 8, 34, 54, 2, 3}
    gap := len(numbers) / 2

    for gap > 0 {
        for i := gap; i = gap && numbers[j-gap] > temp {
                numbers[j] = numbers[j-gap]
                j -= gap
            }
            numbers[j] = temp
        }
        gap /= 2
    }

    // Print the sorted slice
    // Your code here
}

Hint

Use fmt.Println(numbers) to display the sorted slice.