I don't think it's that math heavy. AFAIK there are 3 kinds of analysis: 1) execution counting: loops count (n, n^2) etc., with sorting: nlogn, recursion (c^n

I don't think it's that math heavy. AFAIK there are 3 kinds of analysis: 1) execution counting: loops count (n, n^2) etc., with sorting: nlogn, recursion (c^n) - used to prove worst case. You have to be familiar with big O notation. 2) amortised analysis - proves average case 3) proving lower bounds (usually based on tree of possibilites) - proves that something can't be done more efficiently (this might be math heavy) Just grab some book on algorithms - they usually start with algorithm analysis intro.