What is an algorithm? At its most basic, an algorithm is a method for solving a computational problem. Along with an algorithm comes a specification that says what the algorithm’s …

Think of an algorithm as being a little box that can solve a certain class of computational problems. Into the box goes a description of a particular problem in that class, and then, after …

Learn about a number of known algorithms for solving a wide range of problems. Learn about design techniques for designing your own algorithm. Become better at analyzing the running …

We keep the material in algorithmic con- text, describing data structures, algorithm design paradigms, reduction, and problem-solving models. We cover classic methods that have been …

We then discuss the MergeSort algorithm in detail, for several reasons: it’s a practical and famous algorithm that you should know; it’s a good warm-up to get you ready for more intricate …

• An algorithm may run faster on certain data sets than on others, • Finding theaverage case can be very difficult, so typically algorithms are measured by the worst-case time complexity.

We will compare our algorithm against theoretical lower bounds. An online algorithm is one in which we receive a sequence of inputs, where we must decide on the best possible outcome …