Simplest sort algorithm

Simple and innefficient - HN / arxiv.org

void sort() {
    for( int i = 0; i < N; i++)
        for( int j = 0; j < N; j++)
            if( id[i] < id[j])
                swap( i, j);
}

caption

Written on October 14, 2022, Last update on October 14, 2022
sort