How to select sort in python

In Python, you can use the selection sort algorithm to sort a list. The basic idea of ​​selection sort is to select the smallest (or largest) element from the unsorted part each time, and then put it at the end of the sorted part.

The operating system for this tutorial: Windows 10 system, Python version 3.11.4, Dell G3 computer.

In Python, you can sort a list using the selection sort algorithm. The basic idea of ​​selection sort is to select the smallest (or largest) element from the unsorted part each time and put it at the end of the sorted part. The following is a simple implementation example of selection sort:

def selection_sort(arr):
    n = len(arr)
    for i in range(n-1):
        min_idx = i
        for j in range(i+1, n):
            if arr[j] < arr[min_idx]:
                min_idx = j
        arr[i], arr[min_idx] = arr[min_idx], arr[i]  # 交换找到的最小元素和当前位置元素
    return arr
# 示例
my_list = [64, 25, 12, 22, 11]
sorted_list = selection_sort(my_list)
print(sorted_list)

In this example, the selection_sort function uses the selection sort algorithm to sort the input list. It first traverses the elements in the unsorted part, finds the index of the smallest element, and then exchanges it with the element at the current position to achieve sorting. After sorting, the elements in the list will be arranged in ascending order.

It should be noted that the time complexity of the selection sort algorithm is O(n^2), so it may not be the optimal choice when processing large data sets. For sorting requirements in practical applications, it is recommended to use Python's built-in sorted function or sort method, which use more efficient sorting algorithms.

The above is the detailed content of How to select sort in python. For more information, please follow other related articles on the PHP Chinese website!