# Analysis of algorithm

Analysis refers to prediction without having to run the algorithm

How to tell if an algorithm terminates?^{ᛦ}

How to check an algorithm for correctness?^{ᛦ}

How to check an algorithm's time complexity?^{ᛦ}

How to check an algorithm's space complexity?^{ᛦ}

Proving asymptotics using limits^{ᛦ}

Common asymptotic growth functions^{ᛦ}

Solving recurrence relations^{ᛦ}

Solving fibonacci by induction^{ᛦ}

Recursion trees^{ᛦ}

Masters Theorem^{ᛦ}

Pitfalls of using asymptotic notation over a limited domain^{ᛦ}

Using range transformations to solve recurrence relations^{ᛦ}