← Home · All topics

Binary Search

2 GoKawiil briefs on this topic

CP-Algorithms explains treap data structure combining BST and heap properties

The article describes the treap (cartesian tree), a data structure that stores (X,Y) pairs as a binary search tree ordered by X and a binary heap ordered by Y. It credits Raimund Seidel and Cecilia Aragon with proposing the structure in 1989, and explains that assigning random priority values yields balanced trees, giving operations like insert and search O(log N) average complexity.

cp-algorithms.com · 2026-10-26

Amazon researchers detail Verus, an automated verifier for Rust code

Verus is an open-source tool that mathematically verifies Rust programs against formal specifications, checking correctness across all possible inputs rather than sampling test cases. It builds on Rust's existing memory-safety guarantees to also confirm that code produces expected results and doesn't leak sensitive data.

amazon.science · 2026-09-14