From 277fcd5c2fa726e46d58d2854742812f52392ea2 Mon Sep 17 00:00:00 2001 From: Jidong Xiao Date: Tue, 19 Sep 2023 23:29:25 -0400 Subject: [PATCH] testing superscript --- lectures/07_order_notation_recursion/README.md | 2 +- 1 file changed, 1 insertion(+), 1 deletion(-) diff --git a/lectures/07_order_notation_recursion/README.md b/lectures/07_order_notation_recursion/README.md index c202b5b..e079f16 100644 --- a/lectures/07_order_notation_recursion/README.md +++ b/lectures/07_order_notation_recursion/README.md @@ -70,7 +70,7 @@ quadratic root. - 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 log n), e.g., sorting. -- 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. ## 7.6 Exercise: A Slightly Harder Example