-
Notifications
You must be signed in to change notification settings - Fork 3
Expand file tree
/
Copy pathBubbleSort.py
More file actions
49 lines (46 loc) · 1.95 KB
/
BubbleSort.py
File metadata and controls
49 lines (46 loc) · 1.95 KB
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
import Jobs
def createJobs(alist,worker,isReveresed):
jobs = []
for i,t in enumerate(alist):
jobs.append(Jobs.JobGoTo(i))
jobs.append(Jobs.JobPlaceTreasure(i,treasure=t))
exchanges = True
passnum = len(alist)-1
while passnum > 0 and exchanges:
exchanges = False
for i in range(passnum):
if isReveresed:
if alist[i]<alist[i+1]:
exchanges = True
temp = alist[i]
jobs.append(Jobs.JobGoTo(i))
jobs.append(Jobs.JobPickUpTreasure(i))
jobs.append(Jobs.JobStoreTreasure())
alist[i] = alist[i+1]
jobs.append(Jobs.JobGoTo(i+1))
jobs.append(Jobs.JobPickUpTreasure(i+1))
jobs.append(Jobs.JobGoTo(i))
jobs.append(Jobs.JobPlaceTreasure(i))
alist[i+1] = temp
jobs.append(Jobs.JobGoTo(i+1))
jobs.append(Jobs.JobSwapHandWithContainer())
jobs.append(Jobs.JobPlaceTreasure(i+1))
else:
if alist[i]>alist[i+1]:
exchanges = True
temp = alist[i]
jobs.append(Jobs.JobGoTo(i))
jobs.append(Jobs.JobPickUpTreasure(i))
jobs.append(Jobs.JobStoreTreasure())
alist[i] = alist[i+1]
jobs.append(Jobs.JobGoTo(i+1))
jobs.append(Jobs.JobPickUpTreasure(i+1))
jobs.append(Jobs.JobGoTo(i))
jobs.append(Jobs.JobPlaceTreasure(i))
alist[i+1] = temp
jobs.append(Jobs.JobGoTo(i+1))
jobs.append(Jobs.JobSwapHandWithContainer())
jobs.append(Jobs.JobPlaceTreasure(i+1))
passnum = passnum-1
jobs.append(Jobs.JobIdle())
return jobs