std::sort
binarysearch
macro usz binarysearch(list, x, cmp = EMPTY_MACRO_SLOT, context = EMPTY_MACRO_SLOT) @builtinPerform a binary search over the sorted array and return the indexin [0, array.len) where x would be inserted or cmp(i) is true and cmp(j) is true for j in [i, array.len).