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

fixing formatting issues

Browse Source
This commit is contained in:
Jidong Xiao
2023-09-19 23:07:47 -04:00
parent bec9b6bff7
commit b56364a169
1 changed files with 2 additions and 4 deletions
Download Patch File Download Diff File Expand all files Collapse all files

2
lectures/07_order_notation_recursion/README.md
View File

@@ -74,8 +74,6 @@ quadratic root.
- O(n2), O(n3), O(nk), a.k.a. POLYNOMIAL. e.g., find closest pair of points. - O(n2), O(n3), O(nk), a.k.a. POLYNOMIAL. e.g., find closest pair of points.
- O(2n), O(kn), a.k.a. EXPONENTIAL. e.g., Fibonacci, playing chess. - O(2n), O(kn), a.k.a. EXPONENTIAL. e.g., Fibonacci, playing chess.
- Play this [animation](https://jidongxiao.github.io/CSCI1200-DataStructures/animations/dynamic_memory/two_d_array/index.html) to see what exactly the above code snippet does.
## 7.6 Exercise: A Slightly Harder Example ## 7.6 Exercise: A Slightly Harder Example
Here’s an algorithm to determine if the value stored in variable x is also in an array called foo. Can you analyze Here’s an algorithm to determine if the value stored in variable x is also in an array called foo. Can you analyze