1///// The tree sort algorithm. 2///// 3///// Sorts the given `Vec` and returns the result. 4//pub fn tree_sort<T>(arr: Vec<T>) -> Vec<T> 5// where T: PartialEq + PartialOrd + Clone + Copy, 6//{ 7// todo!() 8//}