And use the standard function comment header for any functions, listing the name of the function, the parameters, what the function returns, the algorithm, any assumptions, and any limitations$.$

The sort function should also come with a sample array that is initially unsorted. You must implement the sort yourself.

For testing, use the following array:

$[100953145445829921217421251]$ Yes, $12$ is repeated. Your algorithm needs to handle that.

As a refresher, the basic algorithm is:

Consider sorting n numbers stored in an array A by first finding the smallest element in and exchanging it with the element in A$[1].$ Then find the second smallest element in A and exchange it with A$[2].$ Continue for the first n$-1$ elements in A$.$