-
Notifications
You must be signed in to change notification settings - Fork 9
Expand file tree
/
Copy pathsorting.py
More file actions
36 lines (32 loc) · 984 Bytes
/
Copy pathsorting.py
File metadata and controls
36 lines (32 loc) · 984 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
def sort(number, type):
# sorted = []
n = len(number)
if type == "asc":
while n > 0:
for i in range(1, len(number)):
if (number[i - 1] - number[i]) < 0:
continue
else:
number[i - 1] ^= number[i]
number[i] = number[i - 1] ^ number[i]
number[i - 1] ^= number[i]
n -= 1
return number
if type == "des":
while n > 0:
for i in range(1, len(number)):
if (number[i - 1] - number[i]) < 0:
number[i - 1] ^= number[i]
number[i] = number[i - 1] ^ number[i]
number[i - 1] ^= number[i]
else:
continue
n -= 1
return number
# void swap(int *a, int *b) {
# *a = *a ^ *b;
# *b = *a ^ *b;
# *a = *a ^ *b;
# }
numbers = [2, 4, 5, 1, 3, 10, 9, 6]
print(sort(numbers, "des"))