563 Views
A naïve sort, also known as "brute force" or "generate and test," is a sorting algorithm that generates all the possible permutations of a list, and then tests each permutation until one is found that is correctly sorted. The number of permutations of a list is n!
0 comments