-
Notifications
You must be signed in to change notification settings - Fork 0
/
Copy pathsorting.py
93 lines (59 loc) · 1.65 KB
/
sorting.py
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
37
38
39
40
41
42
43
44
45
46
47
48
49
50
51
52
53
54
55
56
57
58
59
60
61
62
63
64
65
66
67
68
69
70
71
72
73
74
75
76
77
78
79
80
81
82
83
84
85
86
87
88
89
90
91
92
93
def sort(array):
i = 0
for i in range(1, len(array)):
j = i
while array[j-1] > array[j] and j > 0:
array[j-1], array[j] = array[j], array[j-1]
j = j - 1
return array
# this does in 15 steps
def sort2(array):
i = 0
cnt =0;
for i in range(0, len(array)):
for j in range ( 0 , i):
cnt = cnt+1;
print(cnt, i, j, array)
if( array[i] < array[j]):
d = array[i];
array[i] = array[j];
array[j] =d;
print('\n')
return array
def selection(array):
i = 0
cnt =0;
for i in range(0, len(array)):
min = array[i];
for j in range (i , len(array)):
cnt = cnt+1;
print(cnt, i, j, array)
if( min > array[j]):
min = array[j];
d = array[i];
array[i] = array[j];
array[j] =d;
print('\n')
return array
def bubblesort(array):
i = 0
cnt = 0;
length = len(array)
for i in range(0, length):
min = array[i];
for j in range ( 0 ,length - i -1 ):
cnt = cnt+1;
print(cnt, i, j, array)
if( array[i] < array[j]):
d = array[i];
array[i] = array[j];
array[j] =d;
print('\n')
return array
array = [10, 5, 22, 3, 17, 10]
# sorted = selection(array)
# print(sorted)
# sorted = selection2(array)
# print(sorted)
sorted = selection( array);
print(sorted)