'Least j' diaporamas de présentation

Analyzing algorithms using big-O, omega, theta

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).

308 views • 11 slides