Book On Algorithm . Stepanov's more recent and relaxed book, from mathematics to generic programming, is structured more by a roadmap of the history of mathematics, building from egyptian multiplication to monoids, semigroups, and lagrange's theorem, eventually developing modern data structures with their iterators and algorithms used in the stl. Contents preface xiii i preliminaries 1 1 data structures and algorithms 3 1.1 a philosophy of data structures 4 1.1.1 the need for data structures 4 1.1.2. Algorithms, 4th Edition InformIT from www.informit.com Performance analysis of an algorithm: Stepanov's more recent and relaxed book, from mathematics to generic programming, is structured more by a roadmap of the history of mathematics, building from egyptian multiplication to monoids, semigroups, and lagrange's theorem, eventually developing modern data structures with their iterators and algorithms used in the stl. Both books are quite good and both of them are what i...