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.js 
const arr = [3, 1, 4, 1, 5, 9, 2, 6];
let best = arr[0];
for (let i = 1; i < arr.length; i++) {
  if (arr[i] > best) {
    best = arr[i];
  }
}
console.log(best);

Complexity

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

Implementation notes

  • JavaScript stores the input in a const Array whose elements are Number values. The array binding is constant, but the scan does not mutate the array or allocate a replacement.
  • let best = arr[0] seeds the running maximum from the first slot, then the index loop starts at i = 1 and runs while i < arr.length.
  • Each arr[i] > best comparison uses numeric Number values from the array; when the comparison is true, best = arr[i] rebinds the local variable to that value, otherwise best stays unchanged.
  • The replay exposes i, arr[i], best, and whether replacement happened, with updates at values 4, 5, and 9. console.log(best) prints the final number 9; aside from the initial array, the scan creates no ongoing GC pressure.
execution replay The checked-in replay follows the language-neutral state table for `array-find-max`.
cross-language comparison This JavaScript DSA version keeps the same data and final output as every other DSA book in this wave.