CS 112
Lecture 15
Recursion (continued) and Queues
Recursion
- How a recursive function call is evaluated. Trace the stack
during the function call for fib(4).
- Simple recursive definitions for: finding the minimum,
searching an element in an array, sequentially and by binary
search.
Queues
Our next data structure is the queue. I will describe in
class the basic functionality of the circular queue, then you work on it
for the next
homework
.
Afternoon: QT Lab , from
Dominique Thiebaut's
CSC 220 class web page, day 1.
Ileana Streinu