Notas del episodio
Welcome back to our series on Standard Algorithms! Today, we're covering Period 17: Find Minimum. Our main goal is to help you implement the "Find Minimum" standard algorithm.
The "Find Minimum" Algorithm
We'll start by defining the "Find Minimum" algorithm. This algorithm is designed to find the smallest value in an array of numbers. Its logic is very similar to the "Find Maximum" algorithm we covered last time. The core idea is to assume the first number is the smallest and then loop through the rest of the array, updating your "minimum" value whenever you find a smaller number.
We'll review the example code for "Finding Minimum number in an array" and highlight the subtle but important differences from the "Find Maximum" code. We'll show how a single l ...