Introduction to Algorithms Second Edition by - ….pptVIP

Introduction to Algorithms(2nd edition) by Cormen, Leiserson, Rivest Stein Chapter 2: Getting Started (slides enhanced by N. Adlai A. DePano) Overview Aims to familiarize us with framework used throughout text Examines alternate solutions to the sorting problem presented in Ch. 1 Specify algorithms to solve problem Argue for their correctness Analyze running time, introducing notation for asymptotic behavior Introduce divide-and-conquer algorithm technique The Sorting Problem Input: A sequence of n numbers [a1, a2, … , an]. Output: A permutation or reordering [a1, a2, … , an ] of the input