Just got back my first homework in Design and Analysis of Algorithms. I worked very hard on it, so I was glad to have gotten 119/125 on it. Here’s the assignment, as I turned it in.. I missed points for not evaluating 1c at infinity, and for not providing enough detail for the average case in number 3.
He’s just assigned the second homework. It looks to be about the same difficulty level, depending on how hard the recurrence relations at the top turn out to be. And I’m guessing they turn out to be hard.