Slices (Dynamic Arrays)

Dynamic views into backing arrays: pointer, length, capacity, and automatic growth.

Real-World Analogy (Mental Model)

“A camera viewfinder sliding over a panorama photo. The viewfinder has a starting pointer, a current view width (length), and a max frame limit (capacity).”

Interactive Slice Header & Growth Simulator

Dynamic Growth

Click “Append Element” to watch how Go dynamically doubles backing array memory when len == cap!

Slice Header (24 bytes in RAM): reflect.SliceHeader

Data Pointer0x10f0

Length (len)2

Capacity (cap)2

Underlying Contiguous Backing Array in Memory:

[0]10

[1]20

Key Concepts & Rules To Remember

Slice header is a 24-byte struct: `*array`, `len`, and `cap`.
`append()` automatically allocates a larger backing array when capacity is exceeded.
Sub-slicing shares the same underlying array memory.

Step-by-Step Code

1. Understanding Slices (Dynamic Arrays)

Dynamic views into backing arrays: pointer, length, capacity, and automatic growth. In Go, slices (dynamic arrays) is designed around clarity and high runtime efficiency.

example.goGo 1.24+

// 24-byte Slice Header: [ Data Pointer | Len: 2 | Cap: 4 ]
s := make([]int, 2, 4)
s = append(s, 10, 20) // Appends in-place without reallocation!

Common Beginner Pitfalls & Mistakes

Mistake: Misusing slices (dynamic arrays) without understanding its memory or concurrency semantics.

✅ Correct Way: Always follow standard Go idioms and verify with tests.

Self Assessment

Knowledge Check

Verify your understanding with these interactive practice questions.

Quizzes

Quick checks for understanding

Multiple-choice with inline explanations—expand to see why.

What is the primary concept behind Slices (Dynamic Arrays)?

Finished this lesson?

Mark it as complete to track your overall Go mastery.

PreviousArrays

Next Maps