ComputationalComplexity about time

Some common O() notations about TimeComplexity
||'''BigOhNotation'''|| '''meaning''' || '''example'''||
|| O(1) || constant || access element in array ||
|| O(log(n)) || logarithmic || BinarySearch ||
|| O(n) || linear || sequential search ||
|| O(n log(n)) || worse than linear, but not much worse || QuickSort, HeapSort ||
|| O(n^2^) || squar law || selection and InsertionSort ||
|| O(n^3^) || cubic || ultiplication of 2 n * n ||
|| O(C^n^) || exponential || TravelingSalesmanProblem , SetPartitioning ||

SeeAlso EstimateOrderOfAlgorithm