Wave Sort Algorithm Wave Sort is a sorting algorithm that works in O(n log n) time assuming the sort function used works in O(n log n) time. It arranges elements in an array into a sequence where every alternate element is either greater or smaller than its adjacent elements. Reference: [Wave Sort Algorithm - GeeksforGeeks](https://www.geeksforgeeks.org/sort-array-wave-form-2/) # Examples use
(arr: &mut [T])
source not stored for this graph (policy: none)