Naive sort uses the generate and test approach to solving problems which is usually utilized in case when everything else failed. However, sort is not such case. Prolog implementation of insert sort is based on idea of accumulator . Again, we use accumulator to implement bubble sort. If properly implemented it could be a very efficient algorithm.
Quick sort is one of the fastest sort algorithms.
However, its power is often overvalued. Similarly to merge sort, quick sort exploits the divide and conquer method of solving problems. The above implementation of quick sort using append is not very effective. We can write better program using accumulator. Some type of sort can be found in almost all current programs.