-
Notifications
You must be signed in to change notification settings - Fork 0
Expand file tree
/
Copy pathsort2.py
More file actions
40 lines (32 loc) · 789 Bytes
/
sort2.py
File metadata and controls
40 lines (32 loc) · 789 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
37
38
39
40
#!/usr/bin/python3.2
# исходный не сортированный массив
Unsort=['CD','DE','AB','BC']
#
for e in Unsort:
for j in range(0,len(Unsort)):
print (e,j)
if
#all_a=[]
#all_z=[]
#a=[]
#z=[]
#sort=[]
#for e in Unsort:
#all_a.append(e[0])
#all_z.append(e[1])
#for e in all_a:
#if all_a.count(e)==1 and (e not in all_z): a.append(e)
#for e in all_z:
#if all_z.count(e)==1 and (e not in all_a): z.append(e)
##print('e[0]-', e[0], 'e[1]-', e[1])
##if Unsort.count(e[1])==1: a.append(e[0])
##if Unsort.count(e[1])==1: z.append(e[1])
#print ('all_a=',all_a)
#print ('all_z=',all_z)
#print ('a=',a)
#print ('z=',z)
#if len(a)==1 then:
#while len(sort)!=len(Unsort):
#for e in unsort:
##for e in unsort:
#if len(z)==1 then: