Arrays and Iteration

Linear Search

Walk an array once looking for a target value. Return the index of the first match, or -1 if none. The simplest possible search loop.

Algorithm

Canonical input arr = [4, 7, 1, 9, 3, 8] with target = 9 finishes after four compares; the matching index is 3.

Basic Implementation

basic.swift 
func linearSearch(_ arr: [Int], _ target: Int) -> Int {
	for i in arr.indices {
		if arr[i] == target {
			return i
		}
	}
	return -1
}

let arr = [4, 7, 1, 9, 3, 8]
let target = 9
let result = linearSearch(arr, target)
print(result)

Complexity

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

Implementation notes

  • Swift: explicit for i in arr.indices with an early return i the moment arr[i] == target. The stdlib arr.firstIndex(of:) would hide the walk the lesson is teaching.
  • Function signature func linearSearch(_ arr: [Int], _ target: Int) -> Int documents the array contract; the -1 sentinel mirrors the language-neutral spec rather than returning Int?.
  • The replay shows the running index, the element being checked, and a match indicator on each frame.
early exit Return the index the moment `arr[i]` equals the target. Walking past it would defeat the point.
sentinel return A no-match walk falls off the loop and returns `-1`.