data structures

4 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).
• Big-Endian vs Little-Endian: Byte Order Explained
  Big-endian and little-endian are the two ways computers order the bytes of a multi-byte number in memory or in a file, and mixing them up produces wrong values.
• Hash Tables
  A data structure that stores key–value pairs with expected constant-time insertion, lookup, and deletion.
• Binary Search
  An algorithm that locates a target in a sorted array in logarithmic time by repeatedly halving the search interval.