In class today, we discussed the following topics:
- Answering of questions about the lab
- Review of Homework #1
- Discussion of computational complexity (Big Oh == worst case)
- Discussion of computational complexity for front-to-back searching and binary search (O(n) vs O(log2(n))
Here’s the second homework, due Wednesday, 10/14 at the start of class: CSC112Homework2.pdf
Here’s the key to the first homeworK: CSC112Homework1Key.pdf
