Java ????Java ????Java ????Java ????Java ????

Short Answer (5) Order the following growth rates from smallest to largest. n2 n! n logn 2" n log n 1. If you have a O(log n) algorithm running, what happens when you double the size of your problem? What is the Big-O time complexity for an algorithm to display the nth integer in an array of integers? What is the Big-O time complexity for an algorithm to display the nth integer in a linked chain of integers? 2. 4. 5. Given f(n)4n63+5n2+3n log n what is g(n)