I'm still having trouble with Delta Epsilon proofs after tutorial this week, but I am continuing to try to do practice questions to get a hang of them. We started to learn about Big Oh and looking at the number of steps different sorting algorithms take. I think that the way we learned to count steps is fairly simple as I have quite a bit of programming experience and don't really find it difficult to determine how many times each line will run.
In lecture on Friday we did a problem about Penny Piles which I am going to work on writing a program to solve, as it interests me.
No comments:
Post a Comment