INTRODUCTION TO ALGORITHMS

By:

CORMEN THOMAS

Contributor(s):

LEISERSON CHARLES

Material type: Text

TextPublication details: NEW DELHI PHI LEARNING PVT LTD 2009Edition: 3rd edDescription: xix, 1292ISBN:

978-81-203-4007-7

Subject(s):

COMPUTER PROGRAMMING, COMPUTER ALGORITHMS

DDC classification:

005.1/COR/LEI

Summary: This book on algorithms are rigorous but incomplete; others cover masses of material but lack rigor. Introduction to Algorithms uniquely combines rigor and comprehensiveness. 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.

Tags from this library: No tags from this library for this title. Log in to add tags.

Holdings
Item type	Current library	Call number	Status	Notes	Date due	Barcode
Books	Symbiosis Institute of Computer Studies and Research Algorithm	005.1/COR/LEI (Browse shelf(Opens below))	Available	COMPUTER PROGRAMMING, COMPUTER ALGORITHMS		SICSR-B-19554

Browsing Symbiosis Institute of Computer Studies and Research shelves, Shelving location: Algorithm Close shelf browser (Hides shelf browser)

Previous								Next
Previous	005.1/STE ESSENTIAL ALGORITHMS:A PRACTICAL APPROACH TO COMPUTER ALGORITHMS	005.1/STE ESSENTIAL ALGORITHMS:A PRACTICAL APPROACH TO COMPUTER ALGORITHMS	005.1/STE ESSENTIAL ALGORITHMS:A PRACTICAL APPROACH TO COMPUTER ALGORITHMS	005.1/COR/LEI INTRODUCTION TO ALGORITHMS	005.13/SWA MASTERING MACHINE LEARNING WITH PYTHON IN SIX STEPS	005.133/GRU DATA SCIENCE FROM SCRATCH: FIRST PRINCIPLES WITH PYTHON	005.133/GRU DATA SCIENCE FROM SCRATCH: FIRST PRINCIPLES WITH PYTHON	Next

This book on algorithms are rigorous but incomplete; others cover masses of material but lack rigor. Introduction to Algorithms uniquely combines rigor and comprehensiveness. 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.

There are no comments on this title.

to post a comment.