What are the implementations of several common Python algorithms

This article will explain in detail the implementation of several common Python algorithms, and the content of the article is of high quality, so the editor will share it for you as a reference. I hope you will have a certain understanding of the relevant knowledge after reading this article.

1. Select sort

Selective sorting is a simple and intuitive sorting algorithm. Its principle is this: first find the smallest (large) element in the unsorted sequence, store it at the beginning of the sorted sequence, then continue to look for the smallest (largest) element from the remaining unsorted elements, and then put it after the sorted sequence, and so on, until all the elements have been sorted. The algorithm is implemented as follows:

# find the smallest element def FindSmall (list): min=list [0] for i in range (len (list)): if list [I]