JamesFlare/CSCI-1200
1
0
Fork 0
Code Issues Pull Requests Packages Projects Releases Wiki Activity

adding fact animation

Browse Source
This commit is contained in:
Jidong Xiao
2023-09-22 12:26:47 -04:00
parent af0a6030a5
commit bb6d6b9245
1 changed files with 3 additions and 1 deletions
Download Patch File Download Diff File Expand all files Collapse all files

4
lectures/07_order_notation_recursion/README.md
View File

@@ -160,6 +160,8 @@ int fact(int n) {
} }
``` ```
- Play this [animation](https://jidongxiao.github.io/CSCI1200-DataStructures/animations/recursion/factorial/index.html) to see how this fact() function works.
```cpp ```cpp
int intpow(int n, int p) { int intpow(int n, int p) {
if (p == 0) { if (p == 0) {
@@ -269,6 +271,6 @@ The Fibonacci sequence is defined:
Fibonacci sequence. Fibonacci sequence.
2. Write an iterative version of Fibonacci that uses a vector to improve the running time of the function. 2. Write an iterative version of Fibonacci that uses a vector to improve the running time of the function.
3. What is the order notation of the running time for each version? 3. What is the order notation of the running time for each version?
- Play this [animation](https://jidongxiao.github.io/CSCI1200-DataStructures/animations/dynamic_memory/example1/index.html), which illustrates the time complexity of the recursvie version. - Play this [animation](https://jidongxiao.github.io/CSCI1200-DataStructures/animations/recursion/fibonacci/index.html), which illustrates the time complexity of the recursvie version.
4. What is the order notation of the memory usage for each version? 4. What is the order notation of the memory usage for each version?