fixing formatting issues

lectures/07_order_notation_recursion/README.md

@@ -74,8 +74,6 @@ quadratic root.
 - 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.
 
-- 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
 
  Here’s an algorithm to determine if the value stored in variable x is also in an array called foo. Can you analyze