tailieunhanh - Lecture ECE 250 - Algorithms and data structures: Asymptotic analysis

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. | rATERLO ENGINEERING 77 Xf P Asymptotic Analysis 2 Outline 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 rATERLO ENGINEERING 77 Xf P Asymptotic Analysis 3 Background Suppose we have two algorithms how can we tell which is better We could implement both algorithms run them both - Expensive and error prone Preferably we should analyze them mathematically - Algorithm .