March 8 Lecture

Today's lecture was the toughest lecture of all times. I could follow it for the first half but the second half was crazy. We were using 'ceiling' of a number! So after class I asked if it was possible to do it without the use of 'ceilings'. It is impossible. My hopes were crushed. It had to do with j's not being reached with a larger i. I did not quite understand and nor would I understand on the spot. But if it was possible or not is really all I needed to know to learn it over the weekend. Here is a list of questions to explore:
- Why divide by 3 and not any other number? Because the program has 3 loops?
- What are some lists that would give that program best case performance?
- What happens to that if statement in best case and worst case?
- How to 'upgrade' that program (and everything else Danny Heap said to do)
I am sure Heap answered all of this, but I either did not understand or was still trying to understand the part before it. Regardless, it seems like a very good way to understand best case performance. Which is something that troubles me.