Amazon cover image
Image from Amazon.com

Introduction to algorithms

Contributor(s): Material type: TextTextPublication details: Cambridge : MIT Press, ©2022Edition: 4th edDescription: xx, 1291 p. : col. ill. ; 24 cmISBN:
  • 9780262046305
Subject(s): DDC classification:
  • 005.1 23 COR-I
LOC classification:
  • QA76.6 .C662 2022
Contents:
I. Foundations. The role of algorithms in computing II. Sorting and order statistics. Heapsort III. Data structures. Elementary data structures IV. Advanced design and analysis techniques. Dynamic programming V. Advanced data structures. B-trees VI. Graph algorithms. Elementary graph algorithms VII. Selected topics. Multithreaded algorithms VIII. Appendix: Mathematical background. Summations
Summary: "The leading introductory textbook and reference on algorithms"-- This edition has been revised and updated throughout. It includes some new chapters. It features improved treatment of dynamic programming and greedy algorithms as well as a new notion of edge-based flow in the material on flow networks.
Tags from this library: No tags from this library for this title. Log in to add tags.
Star ratings
    Average rating: 0.0 (0 votes)
Holdings
Item type Current library Collection Call number Status Date due Barcode Item holds
Reference Reference IIITD General Stacks Computer Science and Engineering 005.1 COR-I (Browse shelf(Opens below)) Not for loan 012650
Reference Reference IIITD Reference Computer Science and Engineering REF 005.1 COR-I (Browse shelf(Opens below)) Not for loan 012651
Total holds: 0

Includes bibliographical references (pages [1225]-1250) and index.

I. Foundations. The role of algorithms in computing II. Sorting and order statistics. Heapsort III. Data structures. Elementary data structures IV. Advanced design and analysis techniques. Dynamic programming V. Advanced data structures. B-trees VI. Graph algorithms. Elementary graph algorithms VII. Selected topics. Multithreaded algorithms VIII. Appendix: Mathematical background. Summations

"The leading introductory textbook and reference on algorithms"--

This edition has been revised and updated throughout. It includes some new chapters. It features improved treatment of dynamic programming and greedy algorithms as well as a new notion of edge-based flow in the material on flow networks.

There are no comments on this title.

to post a comment.
© 2024 IIIT-Delhi, library@iiitd.ac.in