-
Notifications
You must be signed in to change notification settings - Fork 0
/
Copy pathsort.py
44 lines (37 loc) · 783 Bytes
/
sort.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
#!/usr/bin/python
#-*-coding:utf-8-*-
import os
class Sort():
def __init__(self):
pass
def selsort(self,array):
print("origin data:",array)
for i in range(len(array)):
m = i
for j in range(i+1,len(array)):
if array[j]<array[m]:
m = j
if not m==i:
tmp = array[i]
array[i] = array[m]
array[m] = tmp
print("sorted data:",array)
return array
def insort(self,array):
print("origin data:",array)
for i in range(len(array)):
tmp = array[i]
for j in range(i-1,-1,-1):
if tmp < array[j]:
array[j+1] = array[j]
else:
array[j+1]= tmp
break
print("sorted data:",array)
return array
def bubsort(self,array):
pass
if __name__=='__main__':
s = Sort()
#s.selsort([1,3,5,3,8])
s.insort([1,3,5,3,8])