Q1: Analyze the following Algorithms. Find their running time and asymptotic notations. int fun(int n) {...

Transcribed Image Text:

Q1: Analyze the following Algorithms. Find their running time and asymptotic notations. int fun(int n) { Algorithm 1 int count = 0; ; for (int i = 0; i < n; i++) { for (int j = i; j> 0; j--) { count = count + 1; } } return count; void fun(int n, int arr[]) { int i = 0, j = 0; for(; i < n; ++i) { while(j <n && arr[i] < arrj) { j++; } } Algorithm 2 %3D int fun1 (int n) { if (n <= 1) return n; Algorithm 3 return 2*fun1(n-1); } int fun2(int n) { if (n <= 1) return n; Algorithm 4 return fun2(n-1) + fun2(n-1); double foo (int n) { int i; Algorithm 5 double sum; if (n 0) return 1.0; = = else { sum = 0.0; for (i = 0; i < n; i++) sum += foo (i); return sum; } } Q1: Analyze the following Algorithms. Find their running time and asymptotic notations. int fun(int n) { Algorithm 1 int count = 0; ; for (int i = 0; i < n; i++) { for (int j = i; j> 0; j--) { count = count + 1; } } return count; void fun(int n, int arr[]) { int i = 0, j = 0; for(; i < n; ++i) { while(j <n && arr[i] < arrj) { j++; } } Algorithm 2 %3D int fun1 (int n) { if (n <= 1) return n; Algorithm 3 return 2*fun1(n-1); } int fun2(int n) { if (n <= 1) return n; Algorithm 4 return fun2(n-1) + fun2(n-1); double foo (int n) { int i; Algorithm 5 double sum; if (n 0) return 1.0; = = else { sum = 0.0; for (i = 0; i < n; i++) sum += foo (i); return sum; } }

Answer rating: 100% (QA)

Algorithm 1 int Funint n int count 0 forint i0i ni forint jij0 j count 1 return count Findi... View the full answer