Suggestions about the materials of Asymptotic Notation (Day1-10/2) #8
Description
Dear Dr. Nelson,
Below are some of my suggestions to the materials of Asymptotic Notation (Day1-10/2):
I think it is really useful to provide the definition of the Big-O notation but I think it might be the formatting problem that the definition is finally shown like below.
Also, about the materials, I think it might be useful to provide some more examples of algorithms with different and more complicated time/space complexity. For instance, binary search algorithm and some naive sorting algorithms might be useful examples from my perspective. Those may probably help the beginners know how to do a correct asymptotic analysis and give them an initial idea about the best/average/worst case scenarios (even though for most times we are interested about the bounding of worst-case behavior).