What are the performance characteristics of Go data structures?

Go Data Structure Performance: • Arrays: O(1) access, fixed size • Slices: O(1) access, O(1) amortized append • Maps: O(1) average access, O(n) worst case • Channels: O(1) send/receive, blocking behavior • Strings: Immutable, O(n) concatenation Optimization tips: • Pre-allocate slices with known capacity • Use string.Builder for concatenation • Pool objects to reduce GC pressure • Prefer value types when possible • Use sync.Map for concurrent access Benchmarking: func BenchmarkSliceAppend(b *testing.B) { for i := 0; i < b.N; i++ { var s []int for j := 0; j < 1000; j++ { s = append(s, j) } } } Memory layout: • Structs: Fields laid out sequentially • Interfaces: Pointer to type + data • Slices: Pointer, length, capacity