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