FilesExpand file tree

 master

/

selectionSort.py

Copy path

Blame

More file actions

Blame

More file actions

Latest commit

 

History

History

History

27 lines (20 loc) · 695 Bytes

 master

/

selectionSort.py

Copy path

Top

File metadata and controls

• Code
• Blame

27 lines (20 loc) · 695 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

21

22

23

24

25

26

27

list = []

N = int(input("Enter The Size Of List"))

for i in range(0, N):

a = int(input("Enter The number"))

list.append(a)

# Let's sort list in ascending order using Selection Sort

# Every time The Element Of List is fetched and the smallest element in remaining list is found and if it comes out

# to be smaller than the element fetched then it is swapped with smallest number.

for i in range(0, len(list) - 1):

smallest = list[i + 1]

k = 0

for j in range(i + 1, len(list)):

if list[j] <= smallest:

smallest = list[j]

k = j

if smallest < list[i]:

temp = list[i]

list[i] = list[k]

list[k] = temp

print(list)