Calculate the execution time and Big-O notation of the codes given below. 12for (i = 0; i <= n; i++){ j = n; while (j >= i) j--; }int vize(int n){ int t = 0; for (int i = n; i > 0; i /= 2) for (int j = 0; j < i; j++) t += 1; return t;}34int fonksiyon1(int n){ if (n <= 8) return 1; return n*fonksiyon1(n/3);} for (int i = 1; i <= n; i++){ for (int j = 1; j < n; j = j * 2) { c = i * j; } } 12for (i{j = n;while (j >= i)j--;}= 0; i <= n; i++)int vize(int n){int t = 0;for (int i:for (int j = 0; j < i; j++)= n; i > 0; i /= 2)t += 1;return t;34int fonksiyon1(int n){if (n <= 8)return 1;return n*fonksiyon1 (n/3);}for (int i =1; i <= n; i++){for (int j{1; j < n; j = j * 2)C = i * i:}}

Answered: Calculate the execution time and Big-O…

7th Edition

ISBN:9780133594140

Author:James Kurose, Keith Ross

Publisher:James Kurose, Keith Ross

Chapter1: Computer Networks And The Internet

Section: Chapter Questions

Problem R1RQ: What is the difference between a host and an end system? List several different types of end...

Related questions

Question

Calculate the execution time and Big-O notation of the codes given below.

1	2
for (i = 0; i <= n; i++) { j = n; while (j >= i) j--; }	int vize(int n) { int t = 0; for (int i = n; i > 0; i /= 2) for (int j = 0; j < i; j++) t += 1; return t; }
3	4
int fonksiyon1(int n) { if (n <= 8) return 1; return n*fonksiyon1(n/3); }	for (int i = 1; i <= n; i++) { for (int j = 1; j < n; j = j * 2) { c = i * j; } }