• Insert-sort

  • Merge-sort

  • Clone

  • Deep clone

  • Dealing with clash of hash code

  • HeapSort

  • Quick sort

  • Tim sort

  • Breadth-first sort

  • Depth-first sort

  • Topological sort

  • Tabulation

  • Memory

  • Seam-Carving

  • Edit Distance

  • Finite State Machine

  • Hidden Markov Models (HMMs)

  • The CYK algorithm

  • LL(1) Predictive parsing

  • Stack

  • Queue

  • Heap

  • Array

  • Fixed-size array

  • Extensible array

  • Linked list

  • Set

  • Dictionary

  • Hash table

  • Balanced tree

  • Red-black tree

  • Graph

  • Syntax tree

  • Asymptotic notation

  • Amortized cost

  • Divide and conquer

  • Master theorem

  • Dynamic programming

  • Nondeterministic polynomial (NP)

  • NP-completeness

  • Context-free grammar (CFG)
  • Context-sensitive rule
  • Sentential form
  • Chomsky normal form