Answer:

No.

The problem with selection sort is the algorithm, not in the programming language. The algorithm uses a doubly nested loop, which will result in N² behaviour in any language. Implementing the algorithm in a super efficient language (like assembly language) has the effect of lowering K in Time ≅ K*N², but with large N N² will be very large and running time will still be slow.

End of Chapter

The next chapter will discuss insertion sort, another simple sort.

Select a few of the following topics to review:

sorted order Sorted Order
negative integer bug Negative Integer Bug
algorithm in order Algorithm: is a list in order?
selection sort Selection Sort
selection sort time Running time for Selection Sort
simple sort Simple Sorts