Recurrence Relations
In analyzing the Towers of Hanoi, we might want to know how many
moves it will take. Let T(n) stand for the number of moves it takes to
solve the Towers problem for n disks. Then, we have the following
formula:
T(n) = T(n-1) + 1 + T(n
Verifying an Algorithmic Analysis through running actual
code
Let's assume that T(N) is the experimental running time of a piece
of code and we'd like to see if T(N) O(F(N).
One way to do this is by computing T(N)/F(N) for a range of
different values for
Computer Science I Spring 2016
Dr. Rochelle Elva
Lecture 21 Introduction to Stacks
Announcements
The
solutions to the Exam 1 will be posted on Webcourses
Grades for Quiz 1 will soon be updated to reflect the SPARTA
contribution (I received your scores yes