Analyzing algorithms using big.ppt

Analyzing algorithms using big-O, omega, theta First, we analyze some easy algorithms. Most of them have the same running time for all inputs of length n. Example 1 char A[100] for i = 1..100 print A[i] Running time: 100*c = Theta(1) (why?) O(1), Omega(1) = Theta(1) Example 2 char A[n] for i = 1..n print A[i] Running time: n*c O(n), Omega(n) = Theta(n) Example 3 int A[n] for i = 1..n binarySearch(A, i) Remember: binarySearch is O(lg n). O(n lg n) Example 4 char A[n] for i = 1..n for j = 1..n print A[i] O(n^2), Omega(n^2) = Theta(n^2) Example 5 char A[n] char A[n] for i = 1..n = for i = n/2..n for j = 1..i for j = 1..n/2 print A[j] print A[j] Big-O: i is always = n, so j always iterates up to at most n, so this is less work than n*n, which is O(n^2). Big-Omega: Useful trick: consider the iterations of the first loop for which i = n/2. In these iterations, the second loop iterates from j=1 to at least j=n/2. Therefore, the time to perform just these iterations is at least n/2*n/2 = (1/4) n^2, which is Omega(n^2). The time to perform ALL iterations is even more than this so, of course, the whole algorithm must take Omega(n^2) time. char A[n] char A[n] for i = 1..n = for i = n/2..n for j = 1..i for j = n/4..n/2 for k = 1..j for k = 1..n/4 for l = 1..7 for l = 1..7 print A[k] print A[k]