An extensively revised edition of a mathematically rigorous yet accessible introduction to algorithms.

The answer is algorithms. And how do these mathematical formulations translate themselves into your GPS, your laptop, or your smart phone? This book offers an engagingly written guide to the basics of computer algorithms.

Like the first edition, this text can also be used for self-study by technical professionals since it discusses engineering issues in algorithm design as well as the mathematical aspects.

The first edition won the award for Best 1990 Professional and Scholarly Book in Computer Science and Data Processing by the Association of American Publishers. This edition is no longer available.

... Cormen's parallel Quicksort algorithm based on implementations using Python shared-memory multiprocessing and multi-threading approaches. It is important to emphasize that we implemented Cormen's algorithm in Python because the ...

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.

Many exercises and problems have been added for this edition. The international paperback edition is no longer available; the hardcover is available worldwide.

... Cormen, T.H., Wisniewski, L.F.: Columnsort lives! An efficient out-of-core sorting program. In: Proceedings of the Thirteenth Annual ACM Symposium on Parallel Algorithms and Architectures. (2001) 169–178 Chaudhry, G., Cormen, T.H. ...