Assignment 2

I went to office hours this week to help me start on the first question of Assignment 2. When I was there I thought it helped a lot and that I was going to get far once I sat down and really thought about it. Well, I thought about it and I still don't know what to do. I think that the pattern is like the Fibonacci numbers, but I don't know how the actual digits are transformed from one length to the next, or where to partition it or whatever we are supposed to do. I'm pretty worried about it, especially because I am not able to go to office hours tomorrow before it's due.

The second question is going a little better than the first, though, mostly because we kind of get to copy from the Course Notes. I think I have the first part done, so now I just need to prove that T is in big theta of log(n). Hopefully this won't be too hard. My brain is pretty tired at the moment, so I will come back to the assignment tomorrow after class and before and after I have to work.