pub fn sort<T>(array: &mut [T])
where
    T: std::cmp::Ord + std::clone::Clone,
{
    sort_by(array, |l, r| l.cmp(r))
}
/// Sort in ascending order using a binary insertion sort algorithm.
///
/// ```rust
/// use buldak::binary_insertion;
///
/// let mut nums = [1, 4, 2, 3, 5, 111, 234, 21, 13];
/// binary_insertion::sort(&mut nums);
/// assert_eq!(nums, [1, 2, 3, 4, 5, 13, 21, 111, 234]);
/// ```
Sort in ascending order using a binary insertion sort algorithm.


Sort in ascending order using a binary insertion sort algorithm .
pub fn sort<T>(array: &mut [T])
where
    T: std::cmp::Ord + std::clone::Clone,
{
    sort_by(array, |l, r| l.cmp(r))
}
pub fn sort < T > ( array : & mut [ T ] ) where T : std :: cmp :: Ord + std :: clone :: Clone , { sort_by ( array , | l , r | l . cmp ( r ) ) }
Sort in ascending order using a binary insertion sort algorithm.
Sort in ascending order using a binary insertion sort algorithm .
array
&mut [T]
array
&mut [T]