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.rs 
fn main() {
	let arr = [3, 1, 4, 1, 5, 9, 2, 6];
	let mut best = arr[0];
	for i in 1..arr.len() {
		if arr[i] > best {
			best = arr[i];
		}
	}
	println!("{}", best);
}

Complexity

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

Implementation notes

  • The checked source uses a fixed array literal, let arr = [3, 1, 4, 1, 5, 9, 2, 6], not a Vec.
  • let mut best = arr[0] copies the first i32 value into a mutable local; the array itself is never mutated.
  • The loop is index-based: for i in 1..arr.len(). Each arr[i] read is bounds checked by Rust, and the exclusive range keeps i within the array length.
  • Comparisons use copied integer values. When arr[i] > best, assignment best = arr[i] copies the new scalar into the local.
  • The trace records replacements at i=2 (4), i=4 (5), and i=5 (9); scans at i=1, i=3, i=6, and i=7 leave best unchanged.
  • println!("{}", best) uses the display formatter for the final integer and prints 9.
execution replay The checked-in replay follows the language-neutral state table for `array-find-max`.
cross-language comparison This Rust DSA version keeps the same data and final output as every other DSA book in this wave.