01760nam a22002777a 4500 20260916155213.0 260916s2022 |||||||| |||| 00| 0 eng d 9780262046305 PK-LaUMT 005.1 INT- Introduction to algorithms / Thomas H. Cormen . . . [et al.] 4th ed. Cambridge : The MIT Press, 2022 xx, 1291 p. Includes bibliographical references and index. A comprehensive update of the leading algorithms text, with new material on matchings in bipartite graphs, online algorithms, machine learning, and other topics.Some books on algorithms are rigorous but incomplete; others cover masses of material but lack rigor. Introduction to Algorithms uniquely combines rigor and comprehensiveness. It covers a broad range of algorithms in depth, yet makes their design and analysis accessible to all levels of readers, with self-contained chapters and algorithms in pseudocode. Since the publication of the first edition, Introduction to Algorithms has become the leading algorithms text in universities worldwide as well as the standard reference for professionals. This fourth edition has been updated throughout, with new chapters on matchings in bipartite graphs, online algorithms, and machine learning, and new material on such topics as solving recurrence equations, hash tables, potential functions, and suffix arrays. Eng Algorithms Computer algorithms 3596 Computer programming Cormen, Thomas H. 15545 Leiserson, Charles Eric 15546 Rivest, Ronald L. 15547 Stein, Clifford 15548 BK 142531 142531 0 0 0 0 01 01 2026-09-16 0 T 005.1 INT- 154490 2026-09-16 15:52:30 2026-09-16 BK 0 0 0 0 01 01 2026-09-16 0 T 005.1 INT- 154491 2026-09-16 15:52:43 C.2 2026-09-16 BK 0 0 0 0 01 01 2026-09-16 0 005.1 INT- 154492 2026-09-16 15:52:53 C.3 2026-09-16 BK