Insertion Sort Algorithm in DSA Go - Build from Scratch

Insertion Sort Algorithm

📖 Scenario: You have a list of unsorted numbers representing daily temperatures. You want to arrange them from lowest to highest to easily see the trend.

🎯 Goal: Build a program that sorts a list of integers using the insertion sort algorithm step-by-step.

📋 What You'll Learn

Create a slice of integers with exact values

Use a variable to track the current index in the sorting process

Implement the insertion sort logic using loops

Print the sorted slice at the end

💡 Why This Matters

🌍 Real World

Sorting data like temperatures helps in analyzing trends and making decisions, such as weather forecasting or climate studies.

💼 Career

Understanding sorting algorithms is fundamental for software development roles, especially when optimizing data processing and improving performance.

1

Create the initial slice of temperatures

Create a slice called temps with these exact integer values: 29, 15, 42, 8, 33

DSA Go

# Create the slice temps with values 29, 15, 42, 8, 33
# Your code here

Hint

Use temps := []int{29, 15, 42, 8, 33} to create the slice.

2

Add a variable to track the current index

Add a variable called i of type int to track the current index in the sorting process, starting from 1

DSA Go

package main

import "fmt"

func main() {
    temps := []int{29, 15, 42, 8, 33}
    // Declare variable i starting at 1
    // Your code here
}

Hint

Write i := 1 to start from the second element.

3

Implement the insertion sort logic

Use a for loop with variable i from 1 to the length of temps. Inside it, use a variable key to hold temps[i] and another variable j starting at i - 1. Use a for loop to move elements greater than key one position ahead. Insert key at the correct position.

DSA Go

package main

import "fmt"

func main() {
    temps := []int{29, 15, 42, 8, 33}
    i := 1
    // Implement insertion sort logic here
    // Your code here
}

Hint

Use nested loops to shift elements and insert the key in the right place.

4

Print the sorted slice

Print the sorted temps slice using fmt.Println(temps)

DSA Go

package main

import "fmt"

func main() {
    temps := []int{29, 15, 42, 8, 33}
    for i := 1; i = 0 && temps[j] > key {
            temps[j+1] = temps[j]
            j--
        }
        temps[j+1] = key
    }
    // Print the sorted temps slice
    // Your code here
}

Hint

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