Lazicci Stable Sort ~ A natural version of Laziest Stable that runs around the same complexity. Best case: O(n) Average/worst case: O(n¹⋅⁵) Takes O(1) memory. Stable: Yes Online: No/Yes In-Place: Yes Deterministic: Yes
Credit to fungamer2.
