Gritsort

{{Infobox Sorting Algorithm }}
 * name = Gritsort
 * image =
 * notes =
 * category = Selection
 * aliases =
 * worst-case = $$O(n^{\frac{3}{2} }\log^{\frac{1}{2} }n)$$ ($$O(n)$$ data moves)
 * average-case = $$O(n^{\frac{3}{2} }\log^{\frac{1}{2} }n)$$
 * best-case = $$O(n^{\frac{3}{2} }\log^{\frac{1}{2} }n)$$ $$O(n)$$ {equal keys)
 * space = $$O(1)$$
 * stable = Yes
 * online = No
 * deterministic = Yes
 * author = aphitorite, Sep 2022