Description: 1, respectively, to write the following function recursive algorithms and iterative algorithms and function values obtained when n = 10. Fib (n) = n when n = 0 or n = 1 fib (n-2)+Fib (n-1) when n2 2. Assumed to take the lead in the circular list of the node that queue, and set a pointer to a team only tail element nodes without head pointer, try to write the queue initialization into the queue, a queue and to determine queue status algorithm. Using the algorithm described above to complete the following operations, after each operation, the output queue status. 1) each of the following elements into the team: 5,7,3,8,55 status: 2) three elements of the five elements dequeue state: 3) two elements dequeue state of two elements: team empty 4) and then 1 elements dequeue status: Team empty (indicating underflow)
To Search:
File list (Check if you may need any files):
实验一1陈道远2罗传炜\~$班级.doc
....................\上机作业1递归.c
....................\上机作业2.c
....................\作业1迭代.c
实验一1陈道远2罗传炜
....................\班级.doc
Download