Analyze the following Algorithms. Find their running time and asymptotic notations. Algorithm 1 int fun(int n)...

 

Transcribed Image Text:

Analyze the following Algorithms. Find their running time and asymptotic notations. Algorithm 1 int fun(int n) int count 0; for (int i 0; i< n; i++) for (int j= i; j> 0; j-) count = count + 1; return count; Analyze the following Algorithms. Find their running time and asymptotic notations. Algorithm 1 int fun(int n) int count 0; for (int i 0; i< n; i++) for (int j= i; j> 0; j-) count = count + 1; return count;