计算机科学导论v10_练习2 2010.pptVIP

6. A variation of the insertion sort algorithm is the selection sort. It begins by selecting the smallest entry in the list and moving it to the front. It then selects the smallest entry from the remaining entries in the list and moves it to the second position in the list. By repeat-edly selecting the smallest entry from the remaining portion of the list and moving that entry forward, the sorted version of the list grows from the front of the list, while the hack portion of the list consisting of the remaining unsorted entries shrinks. Use our pseudocode to express a procedure similar to that