In class today, the following topics were covered:
- a discussion of homework question 4, wherein I want you to focus on how many items do you have to look at
- a discussion of other measures of efficiency (other than just time): space and energy
- an implementation of binary search that is iterative in nature
- the definition of the sorting problem, and the terms ascending/descending
- the algorithm for selection sort (a discussion of selection sort starts on page 205 of the book)
- a computational complexity analysis of selection sort (O(n^2) always)
Here’s all of the search algorithms we have used, all in one file: search.cpp
Here’s an implemented version of selection sort: selectionSort.cpp
If you want more information on energy as an efficiency issue, check out these slides: Jack Dongarra (University of Tennessee) presentation during Wake Forest High Performance Computing workshop (particularly the slides around #20)
Remember, no lab today!
