Lecture Algorithms and data structures: Chapter 7 - Merge Sort
Lecture Algorithms and data structures: Chapter 7 - Merge Sort
In this topic, we will look at: Justification for analysis, quadratic and polynomial growth, counting machine instructions, Landau symbols, Big-Q as an equivalence relation, little-o as a weak ordering.