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.sh
#!/usr/bin/env bash
set -euo pipefail
arr=(3 1 4 1 5 9 2 6)
best=${arr[0]}
for ((i = 1; i < ${#arr[@]}; i++)); do
	if [ "${arr[i]}" -gt "$best" ]; then
		best=${arr[i]}
	fi
done
echo "$best"

Complexity

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

Implementation notes

  • Keep the explicit control flow. Library shortcuts would hide the state changes this lesson is meant to replay.
  • The final output is intentionally small and deterministic for cross-language comparison.
execution replay The checked-in replay follows the language-neutral state table for `array-find-max`.
cross-language comparison This Bash DSA version keeps the same data and final output as every other DSA book in this wave.