Analysis of Typical Loops
for( int j = n; j > 0; j = j/2 )
for( int k = 1; k <= j; k++ )
{
O(1)
}
Complexity: O(n log(n)), but this is
not tight
.