Wikis›01. Searching and Sorting›12. Specialized Search and Sorted-Order ProceduresEytzinger Layout SearchBinary search over an array arranged in heap order to improve cache locality and branch predictability.
Wikis›01. Searching and Sorting›7. Divide and Conquer SortingCache Efficient Merge SortMerge sort variant designed to improve cache locality by structuring recursion and merging to fit memory hierarchies.