Class Sorting algorithm

[firix]

Hello,

Class Sorting algorithm;
O(n2)
O(n log n)
O(n log n)
O(n)

Could you explain what this is ?

[Kyon]

O(n!) // Factorial
O(n2) // Quadratic
O(n log n) // Quasilinear
Q(n) // Linear
Q(log n) // Logarithmic
Q(1) // Constant 

That's the "Big O notation", it stands for the complexity of an algorithm. It usually stands for; amount of comparisons, amount of calculations (and what calculations). Although I don't have too much experience in using it myself, that's all I could remember, for further reference, please check:
http://en.wikipedia.org/wiki/Big_O_notation#Orders_of_common_functions
http://www.google.com

[firix]

thanks