Sorry slides were lost because the sound was not working.
  - Loop Invariants including GCD and on
    (But except for the new slides on GCD and on Multiplying)
  - Also we did not prove that sorting takes N log N time.
  - Recursion looking at multiplying with 4 and with 3 friends.
    and recurrence relations.

You can look at last terms.

If you want it with good sounds look here
http://carlin.uit.yorku.ca/faculty/relay/2014-15Fall/jeff/LEEECS3101E/3101_rec_1_-_20140924_172106_5.html