pub fn insertion_sort<T: Ord + Clone, const N: usize>(vec: &mut Vec<T, N>)
Sort a heapless vector using insertion sort (good for small vecs)