All sorts
  bubble
  selection
  insertion
  shell
  radix
  pq sort
  heap sort
  tree sort
  merge sort
  quick sort
  intro sort

All searches
  sequential
  binary
  interpolation

maps, sets
  Using insert, find, erase
  Run times
  Collections of collections

Heaps
  Max, min
  push
  pop
  top
  Complete binary trees
  heap sort
  priority queues

Divide and Conquer
  Divide
  Conquer
  Combine

  Merge sort
    Complexity

  Quick sort
    Complexity
    Partition

  Quick select
    kth-order statistic
    
Graphs

  Representations
    Matrix
    Adjacency list

  Breadth-first search

  Depth-first search

  Topological sort

  Minimum-cost path
    Dijkstra's
    Bellman-Ford
  
  MST
    Prim

  In what cases would you use the above algorithms?
  Shortest Path vs Minimum Cost Path vs Minimum Spanning Tree

ACM Code of Ethics
  Structure
    General Ethical Principles
    More Specific Professional Responsibilities