Search for a command to run...
Articles tagged with #datastructures
Quick Answer: Git doesn't compare files line-by-line. Instead, it uses a Merkle tree data structure. Every file's content is hashed into a "blob," which is then hashed into a "tree," culminating in a
Quick Answer: To verify massive files from untrusted sources, I use a Merkle tree. This cryptographic data structure chops the file into manageable chunks, hashes each one, and pairs them recursively
Quick Answer: A Merkle tree is a data structure used to quickly verify the integrity of massive files downloaded from untrusted sources. By chopping a file into smaller chunks, hashing them in pairs,
Quick Answer: The djb2 hash function is a highly efficient algorithm that converts strings into integers, commonly used to place items into hash map buckets. It iterates through a string’s ASCII chara
Quick Answer: A Count-Min Sketch is a probabilistic data structure used to estimate the frequency of events in massive datasets. By running items through multiple hash functions and storing counts in
TL;DR: Git is a content-addressable filesystem that stores project states as full snapshots rather than incremental deltas. Every object—blobs, trees, and commits—is identified by a unique SHA-1 hash
