where to use which notation
Hello to all........

I'm new to this subject, and currently i'm learning asymptotic notations. The problem is that i'm confused about the use of these notations. I mean where to use which notation.
For exp. the complexity of insertion sort is O(n^2), why not o(n^2) or omega(n^2).

Plz understand my confusion and explain it.

Thanks in advance!!!!!!!!!!!!!!!!!!!!!!!

This might help you get started. Little-o isn't used very often in computer science, so you'll find yourself sticking to just O, Omega, and Theta.

This might help you get started. Little-o isn't used very often in computer science, so you'll find yourself sticking to just O, Omega, and Theta.

Thanks for the reply!!!!!!!!!!!!!!
But among these three notations which is used where??
Plz explain me in detail.

>But among these three notations which is used where??
>Plz explain me in detail.
If you're not willing to read the tutorial I linked you to (where your question is answered completely), why should I expect you to read anything detailed that I write here?