Wikis›01. Searching and Sorting›12. Specialized Search and Sorted-Order ProceduresBranchless Lower BoundCompute lower bound using arithmetic or conditional moves instead of branches.
Wikis›01. Searching and Sorting›2. Binary Search and Ordered SearchLower BoundFind the first position where a value can be inserted without violating sorted order.