Java ????Java ????Java ????Java ????Java ???? Short Answer (5) Order the followi

Question

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)?

Explanation / Answer

1. logn < n < nlogn < n^2 < 2^n < n!

2. after doubling the size: log(2*n) => still O(logn)

3. Big-O to display nth integer in the array : O(1)

using index we can access in constant time

4. Big-O to display nth integer in the array : O(n)

5. g(n) = O(n^2)

Related Questions

Navigate

• Browse (All)
• Browse J
• Subjects

---

---

Integrity-first tutoring: explanations and feedback only — we do not complete graded work. Learn more.