-
Notifications
You must be signed in to change notification settings - Fork 4.7k
Expand file tree
/
Copy pathselection_sort.py
More file actions
36 lines (27 loc) · 854 Bytes
/
selection_sort.py
File metadata and controls
36 lines (27 loc) · 854 Bytes
1
2
3
4
5
6
7
8
9
10
11
12
13
14
15
16
17
18
19
20
21
22
23
24
25
26
27
28
29
30
31
32
33
34
35
36
"""
Selection Sort
Selection sort repeatedly selects the smallest element from the unsorted
portion and moves it to the end of the sorted portion.
Reference: https://en.wikipedia.org/wiki/Selection_sort
Complexity:
Time: O(n^2) best / O(n^2) average / O(n^2) worst
Space: O(1)
"""
from __future__ import annotations
def selection_sort(array: list[int]) -> list[int]:
"""Sort an array in ascending order using selection sort.
Args:
array: List of integers to sort.
Returns:
A sorted list.
Examples:
>>> selection_sort([3, 1, 2])
[1, 2, 3]
"""
for i in range(len(array)):
minimum = i
for j in range(i + 1, len(array)):
if array[j] < array[minimum]:
minimum = j
array[minimum], array[i] = array[i], array[minimum]
return array