eventual consistency means: all replicas converge to the same state given enough time

CAP theorem states: you can have at most 2 of consistency, availability, partition tolerance

CAP theorem: A system can achieve at most two out of Consistency, Availability, Partition Tolerance

ACID

ACID guarantees data validity in transactions

consistent hashing does: minimizes remapping when nodes join/leave

Consistent hashing distributes data across nodes, minimizing remapping when nodes join/leave

consistent hashing solves: minimizes key redistribution when servers are added/removed

Consistent hashing minimizes key redistribution when servers are added/removed

the optional stopping theorem says about martingales and stopping times

The optional stopping theorem states that for a martingale, stopping at a stopping time with finite expectation preserves the martingale property

merge sort: O(n log n) always

Merge sort consistently performs at O(n log n) time complexity for any input size