Sep 25, 2025 · Analysis of Algorithms is a fundamental aspect of computer science that involves evaluating performance of algorithms and programs. Efficiency is measured in terms of time and space.

In computer science, the analysis of algorithms is the process of finding the computational complexity of algorithms —the amount of time, storage, or other resources needed to execute them.

Why Analyze an Algorithm? Classify problems and algorithms by difficulty. Predict performance, compare algorithms, tune parameters. Better understand and improve implementations and algorithms.

Average Case vs. Worst Case Running Time of an Algorithm. • An algorithm may run faster on certain data sets than on others, • Finding theaverage case can be very difficult, so typically algorithms are …

As examples of how to use our cost model we will analyze a couple of the algorithms we de-scribed for the shortest superstring problem: the brute force algorithm and the greedy algorithm.

It is important to be able to measure, or at least make educated statements about, the space and time complexity of an algorithm.

Gain insight into a topic and learn the fundamentals. This course teaches a calculus that enables precise quantitative predictions of large combinatorial structures.