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.kt 
fun main() {
	val arr = intArrayOf(3, 1, 4, 1, 5, 9, 2, 6)
	var best = arr[0]
	for (i in 1 until arr.size) {
		if (arr[i] > best) {
			best = arr[i]
		}
	}
	println(best)
}

Complexity

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

Implementation notes

  • Kotlin stores the input as a primitive IntArray from intArrayOf(3, 1, 4, 1, 5, 9, 2, 6), so indexed reads return non-null Int values.
  • arr is a val, so the array reference is not rebound. best is a var seeded from arr[0] and is the only scalar state updated during the scan.
  • The loop uses for (i in 1 until arr.size), visiting indexes 1 through 7 and avoiding a second read of the seed element at index 0.
  • if (arr[i] > best) performs a strict Int comparison; equal values do not replace the current maximum.
  • The trace shows replacements at i=2 (3 -> 4), i=4 (4 -> 5), and i=5 (5 -> 9); indexes 1, 3, 6, and 7 leave best unchanged.
  • println(best) uses Kotlin's standard output formatting for the final Int, producing 9.
execution replay The checked-in replay follows the language-neutral state table for `array-find-max`.
cross-language comparison This Kotlin DSA version keeps the same data and final output as every other DSA book in this wave.