SLOG Entry#9

     Here's another SLOG entry. Its midterm week again. On Monday we covered some more about big-oh, talking about how O(lg n) is the big-oh of a function that cuts a list in half again and again for a certain amount of recursion. Most of the fun was on Wednesday when we had another midterm. It wasn't so bad, and I found it easier then the last midterm. Tune in in next time for more computer science.