can anyone help me with question ...NO NEED EXPLANATION ...JUST SIMPLE ANSWER ..

Question

can anyone help me with question ...NO NEED EXPLANATION ...JUST SIMPLE ANSWER ...EXAMPLE [ BIG O (N) ]

NAME Csc 162 Big-o complexity quiz Determine the Big-o complexity for the following segments of code 2. int x n. 1 for (int i n: i 1: i i 7) int y x 10 2 x 3 x: if (x y) System.out.println(i): else for (int i na i 1: i E i /17) System out println(y): System.out.println(i); 4. for (int i 1: i c n: i i 2) 3. for (int i 1: i k n: i++) for int j 1: j n: j++) System out println(i): for (int k 1: k n: k system out.println(k): for (int j 1. j k ni j System out println j). 5. for (int i n: i n: i++) 6. for (int i o: i ni i 108) System out printin(i): system out.println(i).

Explanation / Answer

1)
  
T(n) = log7(n) +log17(n) [ log7(n) means base 7 and value n

Big-O = O(log7(n))

2)
O(1)

3)
O(n^3)
4)
O(nlogn)
5)
O(1)
6)
O(n)
7)
T(n) = O(1000) + O(log53(n))
= O(log53(n))
8)
10*log(n)*n
O(nlogn)
9)
log(n)*n*n
O(n^2logn)
10)
100 + n + 1000

O(n)
11)
O(n^4)
12)
(logn)^3

Related Questions

Navigate

• Browse (All)
• Browse C
• Subjects

---

---

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