We will ground our analysis in a few sample algorithms for finding the smallest value in an array. A few of you asked for an extension, so it is now due next Monday. However, I won't be here on Friday or over the weekend. Big O analysis Algorithms, Revisited You may recall from the first day of class that the foci of CS152 are algorithms and data structures. Algorithms are sets of instructions for completing tasks.
Data structures are mechanisms that organize information.
We will begin with some consideration of algorithm analysis. To help, we'll consider two algorithms for finding the smallest integer in an array. Pick a value in the array . Make that our initial guess. If that value is smaller than our guess, update our guess.