Summary

Terms and concepts

  • amortized analysis
  • association list
  • associative array
  • asymptotic bound
  • banker's method
  • big ell
  • big oh
  • binding
  • brute force
  • bucket
  • chaining
  • collision
  • complexity
  • credits
  • dictionary
  • diffusion
  • direct address table
  • efficiency
  • execution steps
  • exponential time
  • hash function
  • injective
  • input size
  • key
  • load factor
  • map
  • mutable map
  • physicist's method
  • polynomial time
  • potential energy
  • probing
  • red-black map
  • resizing
  • serialization
  • set
  • worst case performance

Further reading

  • More OCaml: Algorithms, Methods, and Diversions, chapter 11, by John Whitington.

  • Introduction to Objective Caml, chapter 8, section 4

  • Real World OCaml, chapter 13.

  • Purely Functional Data Structures, by Chris Okasaki. Cambridge University Press, 1999.

results matching ""

    No results matching ""