On simple explanations

Asymptotic complexities

Finding a pen in a classroom of n students

  • O(n^2) – Asking each student and ask him about others too
  • O(n) – Asking each student
  • O(logn) – Dividing class equally and asking each half
  • O(1) – Damn it, I have it in my pocket Person facepalming

On programming jargos

Algorithm – when programmers don’t want to explain what they did.

Heuristic – when programmers can’t explain what they did.

Machine Learning – when programmers don’t know what they did.