complexity

3 articles · All tags

• Heaps and Priority Queues: How a Binary Heap Works
  A binary heap stores a priority queue in an array, keeping the smallest item at the top, so each insert and each removal takes logarithmic time, or O(log n).
• Hash Tables
  A data structure that stores key–value pairs with expected constant-time insertion, lookup, and deletion.
• Big O Notation
  A notation for describing how an algorithm's runtime or memory usage grows as the input size increases.