Karthik,

At this point I'd suggest stopping. Unless you are involved in theoretical research, you really don't need to figure out how to solve Big O mathematical formulas, just understand the O(n) algorithms are better than O(n²) algorithms. Know when to recognisize them, for instance a nested loop using cursors versus a set-based cross join for example.

Plus, you still haven't answered Gail's original questions.