FilesExpand file tree

 master

/

SelectionSort.py

Copy path

Blame

More file actions

Blame

More file actions

Latest commit

 

History

History

History

20 lines (18 loc) · 655 Bytes

 master

/

SelectionSort.py

Copy path

Top

File metadata and controls

• Code
• Blame

20 lines (18 loc) · 655 Bytes

Raw

Copy raw file

Download raw file

Open symbols panel

Edit and raw actions

1

2

3

4

5

6

7

8

9

10

11

12

13

14

15

16

17

18

19

20

# First, find the smallest item in the array,

# and exchange it with the first entry. Then, find the

# next smallest item and exchange it with the second

# entry. Continue in this way until the entire array is

# sorted. This method is called selection sort because it

# works by repeatedly selecting the smallest remaining

# item (N-1) + (N-2) + …1+ 0

def selectionSort(array):

n = len(array)

for i in range(n - 1):

min = i

for j in range(i + 1 , n):

if array[j] < array[min]:

min = j

array[i], array[min] = array[min], array[i]

array = [10,12,5,11,3]

selectionSort(array)

print(array)