for (int i = 1; i <= n; i *= 2) { for (int j = 0; j < n; j++) { count++; } }
O(n)
O(nlog₂n)
O(n²)
O(log₂n)