Gave examples of data types organized by data structures. Showed a preliminary IPO chart to sort a list of numbers. Discussed how an algorithm's performance should be measured. Discussed that the most important operation of the algorithm should be selected in determining the performance of the algorithm. Discussed which operations are the most important in finding the largest number or sorting a list of numbers.
Preconditions refer to the correctness of the algorithm.
Defined a psot condition which refer to the algorithm's correctness and describes the state of data types, data structures should be in. Gave examples of an algorithm and the post conditions that should exist. Discussed data structures characteristics as space, access methods, logical structures, and physical structures. Evaluate data structures based on these characteristics. Discussed space characteristics as static and dynamic.