Explore the latest books of this year!
Bookbot

Thomas H. Cormen

    Thomas H. Cormen is the co-author of Introduction to Algorithms. He is a Professor of computer science at Dartmouth College and chairs the institution's Writing Program. His work delves into the realm of algorithms and their theoretical underpinnings. Cormen's expertise in this field has been instrumental in shaping advanced computer science studies.

    Algorytmy bez tajemnic
    Algorithms unlocked
    Introduction to Algorithms
    • 2013

      "This book offers an engagingly written guide to the basics of computer algorithms. In Algorithms Unlocked, Thomas Cormen- coauthor of the leading college textbook on the subject- provides a general explanation, with limited mathematics, of how algorithms enable computers to solve problems. Readers will learn what computer algorithms are, how to describe them, and how to evaluate them. They will discover simples ways to search for information in a computer; methods for rearranging information in a computer into a prescribed order ("sorting"); how to solve basic problems that can be modeled in a computer with a mathematical structure called a "graph" (useful for modeling road networks, dependencies among tasks, and financial relationships); how to solve problems that ask questions about strings of characters such as DNA structures; the basic principles behind cryptography; the fundamentals of data compression; and even that there are some problems that no one has figured out how to solve on a computer in a reasonable amount of time."--Back cover

      Algorithms unlocked
    • 2000

      Introduction to Algorithms

      • 1184 pages
      • 42 hours of reading
      4.4(7387)Add rating

      This title 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.

      Introduction to Algorithms