Arrays and Iteration

Find Maximum

Scan the array once, keeping the largest value seen so far. The replay highlights when a candidate replaces the running maximum.

Algorithm

Basic Implementation

basic.go 
package main

import "fmt"

func main() {
	arr := []int{3, 1, 4, 1, 5, 9, 2, 6}
	best := arr[0]
	for i := 1; i < len(arr); i++ {
		if arr[i] > best {
			best = arr[i]
		}
	}
	fmt.Println(best)
}

Complexity

  • Time: O(n)
  • Space: O(1)

Implementation notes

  • Go builds arr with the slice literal []int{3, 1, 4, 1, 5, 9, 2, 6}; the slice header points at a backing array holding those eight integers.
  • best := arr[0] assumes the checked slice is non-empty. An empty slice would panic on that index, but this lesson's literal is fixed.
  • The source uses for i := 1; i < len(arr); i++, not a range loop, so each step reads the current value through arr[i] and Go's normal bounds checks.
  • Only the scalar best mutates. The trace records replacements at i=2 (3 -> 4), i=4 (4 -> 5), and i=5 (5 -> 9), then no replacement for 2 or 6.
  • fmt.Println(best) formats the final integer with a newline, producing 9. The slice contents are never modified.
execution replay The checked-in replay follows the language-neutral state table for `array-find-max`.
cross-language comparison This Go DSA version keeps the same data and final output as every other DSA book in this wave.