Introduction to ALGORITHMS

by T. Cormen, C. Leiserson, and R. Rivest

Introduction:
I have heard this book described as a fountain of information and I would agree. It seems that every time you look through it you come away with more insight into another way of thinking about a problem. When I took a class on computer algorithms using this book I tried to work through as many of the exercises as I could. Below I've included these in the form of scanned notes. In addition, I've tried to LaTeX some of these problem solutions into a solution manual, further explaining on the handwritten notes and working through all problems. I would like to emphasis that these are some notes on this book that I had time to write up. It is not related to any official solution manual that may exist.

• Download
• My original handwritten notes
  • Book Notes (notionally Chapters 1-4/5).
    
  • Book Notes (notionally Chapters 5-6).
    
  • Book Notes (notionally Misc. Chapters 5).
    
  • Book Notes (notionally Chapters 6-11).
    
  • Book Notes (notionally Chapters 8 & 36).
    
  • Book Notes (notionally Chapters 11 & 22).

Chapter 1 (The Role of Algorithms in Computing):

• exercise_1_2_2.m (running times for insertion and merge sorts)
  
• exercise_1_2_3.m (quadratic v.s. exponential running times)
  
Chapter 2 (Getting Started):

• count_inversions.py (an implementation of divide-and-conquer to count array inversions)
  
Chapter 31 (Number-Theoretic Algorithms):

• chap_31_prob_3_5.py (compute some subgroups using generators)
  
Appendix C (Counting and Probability):

• exercise_C_1_12.m (Matlab code to plot the function needed in C-1.12)
  
• exercise_C_2_4.nb (Mathematica code to compute the binary representation of a/b for C-2.4)
  
• exercise_C_3_3.m (a Monte-Carlo simulation for of the probabilities in this problem)
  
• exercise_C_5_1.R
  
Misc:

• A few (very) problems coded in Mathematica