computer science

Introduction to Algorithms

Introduction to Algorithms is a computer science topic covered in the lgStudy science library. This page brings together a partial reference excerpt, illustrations, worked examples, real-world applications and a short study plan, so you can understand Introduction to Algorithms rather than just read about it. In short: Introduction to Algorithms is a book on computer programming by Thomas H. Cormen, Charles E.

Key takeaways

Introduction to Algorithms belongs to computer science; place it in that map before memorising details.
Learn the definition first, then one example that makes the definition concrete.
Connect Introduction to Algorithms to a quantity you can measure, compute or draw — that is where exam questions come from.
Reproduce the core statement of Introduction to Algorithms from memory before moving on to harder problems.

Reference excerpt

Introduction to Algorithms is a book on computer programming by Thomas H. Cormen, Charles E. Leiserson, Ronald L. Rivest, and Clifford Stein. The book is described by its publisher as "the leading algorithms text in universities worldwide as well as the standard reference for professionals". It is commonly cited as a reference for algorithms in published papers, with over 10,000 citations documented on CiteSeerX, and over 70,000 citations on Google Scholar as of 2024. The book sold half a million copies during its first 20 years, and surpassed a million copies sold in 2022. Its fame has led to the common use of the abbreviation "CLRS" (Cormen, Leiserson, Rivest, Stein), or, in the first edition, "CLR" (Cormen, Leiserson, Rivest). In the preface, the authors write about how the book was written to be comprehensive and useful in both teaching and professional environments. Each chapter focuses on an algorithm, and discusses its design techniques and areas of application. Instead of using a specific programming language, the algorithms are written in pseudocode. The descriptions focus on the aspects of the algorithm itself, its mathematical properties, and emphasize efficiency.

Editions The first edition of the textbook did not include Stein as an author, and thus the book became known by the initialism CLR. It included two chapters ("Arithmetic Circuits" and "Algorithms for Parallel Computers") that were dropped in the second edition. After the addition of the fourth author in the second edition, many began to refer to the book as "CLRS". This first edition of the book was also known as "The Big White Book (of Algorithms)". With the second edition, the predominant color of the cover changed to green, causing the nickname to be shortened to just "The Big Book (of Algorithms)". The third edition was published in August 2009. The fourth edition was published in April 2022, which has colors added to improve visual presentations.

Cover design The mobile depicted on the cover, Big Red (1959) by Alexander Calder, can be found at the Whitney Museum of American Art in New York City.

Publication history Cormen, Thomas H.; Leiserson, Charles E.; Rivest, Ronald L. (1990). Introduction to Algorithms (1st ed.). MIT Press and McGraw-Hill. ISBN 0-262-03141-8. Cormen, Thomas H.; Leiserson, Charles E.; Rivest, Ronald L.; Stein, Clifford (2001) [1990]. Introduction to Algorithms (2nd ed.). MIT Press and McGraw-Hill. ISBN 0-262-03293-7. 12 printings up to 2009, errata: Cormen, Thomas H.; Leiserson, Charles E.; Rivest, Ronald L.; Stein, Clifford (2009) [1990]. Introduction to Algorithms (3rd ed.). MIT Press and McGraw-Hill. ISBN 0-262-03384-4. 1320 pp., 5 printings up to 2016, errata: Cormen, Thomas H.; Leiserson, Charles E.; Rivest, Ronald L.; Stein, Clifford (2022) [1990]. Introduction to Algorithms (4th ed.). MIT Press and McGraw-Hill. ISBN 0-262-04630-X. 1312 pp., errata:

Reviews Akl, Selim G. (1991). "Review of 1st edition". Mathematical Reviews. MR 1066870. Mann, C. J. H. (April 2003). "New edition of algorithms book [review of 2nd edition]". Kybernetes. 32 (3). doi:10.1108/k.2003.06732cae.004. Thimbleby, Harold (December 3, 2009). "No excuse to be illiterate about IT [review of 3rd edition]". Times Higher Education. El-Sharoud, Walid (September 2019). "Review of 3rd edition". Science Progress. 102 (3): 278–279. doi:10.1177/0036850419873799b. PMC 10424523.

See also The Art of Computer Programming

References

External links Official website on MIT Press

Worked examples

Example 1 — a first encounter with Introduction to Algorithms

Start with the simplest possible case. Write down what Introduction to Algorithms claims or describes in one sentence, then invent the smallest concrete situation in which that sentence is true. In computer science, the smallest case is usually a single object, a single equation or a single measurement. Check that every symbol or term in your sentence has a meaning in that case.

Example 2 — changing one variable

Take the situation from Example 1 and change exactly one quantity: double it, halve it, or set it to zero. Predict what should happen to Introduction to Algorithms before you calculate. Comparing your prediction with the result is the fastest way to find out whether you understand the idea or only the words.

Example 3 — an exam-style question

Typical questions about Introduction to Algorithms ask you to (a) state it precisely, (b) apply it to given data, and (c) explain a limitation. Practise writing all three answers in under five minutes; the third part is what separates a full-mark answer from an average one.

Applications of Introduction to Algorithms

In research: Introduction to Algorithms appears in computer science research whenever the underlying quantities have to be modelled precisely. Papers usually cite it as a starting assumption and then explore where it breaks down.
In technology and industry: Engineering practice reuses Introduction to Algorithms in design rules, simulations and safety margins. Knowing the idea lets you read a specification sheet and understand why the numbers look the way they do.
In the classroom: Introduction to Algorithms is common in secondary-school and first-year university syllabi. It links to neighbouring topics 1990 non-fiction books, Computer science books, MIT Press books, so understanding it makes those chapters shorter.
In everyday life: Look for Introduction to Algorithms outside the textbook — in sport, cooking, traffic, electronics or the sky above you. An example you found yourself is remembered far longer than one you were given.

Affiliate

Preply — study more efficiently by working with a personal tutor. 50% off.

How to study Introduction to Algorithms in 20 minutes

Read the reference excerpt below once, without taking notes.
Close the page and write down what Introduction to Algorithms means in your own words.
Compare your version with the excerpt and mark what you missed.
Work through the three examples above with pen and paper.
Explain Introduction to Algorithms out loud to somebody else — or to Teacher Smith in the lgStudy chat.

Frequently asked questions

What is Introduction to Algorithms in simple terms?

Introduction to Algorithms is a book on computer programming by Thomas H. Cormen, Charles E.

Why does Introduction to Algorithms matter?

Because it connects several computer science ideas at once: it gives you a definition you can apply, a quantity you can calculate, and a way to check whether a result is plausible.

How should I study Introduction to Algorithms?

Read the excerpt, restate it from memory, then work through the examples and applications listed on this page. The five-step study plan above takes about twenty minutes.

What does this page cover?

It gives you a compact reference excerpt plus original lgStudy explanations, examples, applications and study material on Introduction to Algorithms.