What is the big-O of the function (log n)^k
What is the big-O complexity of the function (log n) k for any k? Any function whose runtime has the form (log n) k is O((log n) k ). This expression isn't reducable to any other primitive function using simple transformations, and it's fairly common to see algorithms with runtimes like O(n (log n) 2 ). Functions with this growth rate are called polylogarithmic. By the way, typically (log n) k is written as log k n, so the above algorithm would have runtime O(n log 2 n. In your case, the function log 2 n + log n would be O(log 2 n). However, any function with runtime of the form log (n k ) has