Please enable JavaScript.
Coggle requires JavaScript to display documents.
Analysis of Algorithm - Coggle Diagram
Analysis of Algorithm
-
-
Notations
Θ notation
Provides a simplified symbology to represent a fair performance limit for an algorithm. An exact time limit for an algorithm to run. That is, the notation Θ represents the meeting point between the notations Ω (lower limit) and Big O (upper limit)
Ω notation
Provides a simplified symbology to represent a lower performance limit for an algorithm. A minimum time limit that an algorithm takes to run. That is, the Ω notation is the inverse of the Big O notation
O notation
When applied to an algorithm, gives us an upper bound on the execution time of that algorithm. Big-oh notation is a universal notation for talking about algorithm performance
Algorithm Visualization
-
Dynamic algorithm visualization, also called algorithm animation
Shows a continuous, movie-like presentation of an algorithm’s operations. Animation is an arguably more sophisticated option, which, of course, is much more difficult to implement.