Like the Big O notation \"O(1)\" can describe following code:
O(1): for (int i = 0; i < 10; i++) { // do stuff a[i] = INT; } O
Binary Search is an example O(log(n)). http://en.wikipedia.org/wiki/Binary_search_algorithm.