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

testing superscript

Browse Source
This commit is contained in:
Jidong Xiao
2023-09-19 23:29:25 -04:00
parent 7eb51a88da
commit 277fcd5c2f
1 changed files with 1 additions and 1 deletions
Download Patch File Download Diff File Expand all files Collapse all files

2
lectures/07_order_notation_recursion/README.md
View File

@@ -70,7 +70,7 @@ quadratic root.
- O(log n), a.k.a. LOGARITHMIC. e.g., dictionary lookup, binary search. - O(log n), a.k.a. LOGARITHMIC. e.g., dictionary lookup, binary search.
- O(n), a.k.a. LINEAR. e.g., sum up a list. - O(n), a.k.a. LINEAR. e.g., sum up a list.
- O(n log n), e.g., sorting. - O(n log n), e.g., sorting.
- O(n2), O(n3), O(nk), a.k.a. POLYNOMIAL. e.g., find closest pair of points. - O(n<sup>2</sup>), O(n<sup>3</sup>), O(n<sup>k</sup>), 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.
## 7.6 Exercise: A Slightly Harder Example ## 7.6 Exercise: A Slightly Harder Example