Fichas
Recursion
Fichas del conjunto (7)
- 1alg for factorial
- 2alg for fibonacciF(n) = F(n-1)+F(n-2)
- 3fibonacci time complexityn passes through for loop
each pass is small constant c
so cn steps - 4reversing a listremove the first element and reverse the remaining elements then add the removed element at the end of the reversed.
- 5sorting a listRemove the minimum element, sort the rest list (recursively), and add the minimum element to the front of the sorted rest list
- 6Tower of Hanoi def1. A larger disk cannot be on top of a smaller disk.
2. Each move consists of popping a disk from one stack and pushing it onto another stack, or more intuitively, taking the disk at the top of one stack and putting it on another stack. - 7Tower of Hanoi alg
Información
- Descripción
- Computer Science Fichas sobre Recursion, creado por Virginie Gagné el 15/04/2022.
- Creado por
- Virginie Gagné
- Visitas
- 0
- Valoración