Groups
Category
Randomized algorithms use coin flips (random bits) to guide choices, often making code simpler and fast on average.
A treap is a binary search tree on keys combined with a heap on random priorities, which keeps the tree balanced in expectation.