smq/directoryAn evolving quant resource archive
Back to directoryResource
Lecture Notes / 2001SMQ / 084
Introduction to Algorithms (second edition)
Charles E. Leiserson / Clifford Stein / Ronald L. Rivest / Thomas H. Cormen
algorithm analysis / algorithm designResource overview

Introduction to Algorithms (second edition)

Lecture Notes2001

by Charles E. Leiserson, Clifford Stein, Ronald L. Rivest, Thomas H. Cormen

Tags
algorithm analysisalgorithm designalgorithmscomputational complexitydata structuresdivide and conquerdynamic programminggraph algorithmsgreedy algorithmssearchingsortingspace complexitytime complexity

Access resource

Open original source Find related lessons

Continue on SelfMadeQuant

Build the foundations

Find a starting point in the curriculum or practise the probability and reasoning used in quant interviews.

Find your starting point in the curriculum Try free quant interview questions

Lesson links open public previews. Access to full lessons depends on the topic and your membership.

Keep exploring

Related resources

More ideas from similar topics.

6

From the same author

Charles E. Leiserson, Clifford Stein, Ronald L. Rivest, Thomas H. Cormen

1