Sorts a mutable slice using in-place insertion sort algorithm. Time complexity is `O(n^2)`, where `n` is the number of elements. Space complexity is `O(1)` as it sorts elements in-place.
(arr: &mut [T])
source not stored for this graph (policy: none)