Skip to Main Content
The course introduces the concept of abstract data types and the advantages of data abstraction. Various commonly used data types will be discussed. In addition, advanced data structures will be covered. Applications including basic sorting and searching methods are described to illustrate the use of data structures, together with the complexity analysis of the algorithms.
Introduction to Algorithms
The book covers a broad range of algorithms in depth, yet makes their design and analysis accessible to all levels of readers. Each chapter is relatively self-contained and can be used as a unit of study. The algorithms are described in English and in a pseudocode designed to be readable by anyone who has done a little programming. The explanations have been kept elementary without sacrificing depth of coverage or mathematical rigor. The third edition has been revised and updated throughout. It includes two completely new chapters, on van Emde Boas trees and multithreaded algorithms, substantial additions to the chapter on recurrence (now called “Divide-and-Conquer”), and an appendix on matrices. It features improved treatment of dynamic programming and greedy algorithms and a new notion of edge-based flow in the material on flow networks.
