Design and Analysis of Algorithm

Activity 02

Direction: Calculate the Actual Running Time and estimate the Worst-Case and Best-Case Scenario of the given Algorithms below.

1. Algorithm 1 int n = 10; int f = 1; int i = 1; do { f *= i; i++; }while(i<=n); cout<

2. Algorithm 2 int s = 5; int n[s] = {3, 7, 2, 1, 9}; int key = 4; int found = -1; for(int i=0; i