Template Function ADS::wiggleSort

• Defined in File Rearrangements.h

Function Documentation

template<class T, class C = std::less<>>
void ADS::wiggleSort(std::vector<T> &A, C less = C())

wiggleSort(): A[ 0 ] <= A[ 1 ] >= A[ 2 ] <= …, by swaps of neighbours; n - 1 comparisons

Post:

A alternates, and holds its items (an audit)