mathdatech/Python
1
0
Fork 0
mirror of https://github.com/TheAlgorithms/Python.git synced 2025-01-19 00:37:02 +00:00
Code Issues Packages Projects Releases Wiki Activity

Added doctests to OddEvenTraposition (#2152)

Browse Source 
* Added doctests

* Change __main__ content
This commit is contained in:
mateuszz0000 2020-06-25 08:56:57 +02:00 committed by GitHub
parent 5b6ebf8f12
commit 9e2206e5fb
No known key found for this signature in database
GPG Key ID: 4AEE18F83AFDEB23
1 changed files with 12 additions and 17 deletions
Show Stats Download Patch File Download Diff File Expand all files Collapse all files

29
sorts/odd_even_transposition_single_threaded.py
View File

@ -7,29 +7,24 @@ is no better than bubble sort.
def OddEvenTransposition(arr): def OddEvenTransposition(arr):
"""
>>> OddEvenTransposition([5, 4, 3, 2, 1])
[1, 2, 3, 4, 5]
>>> OddEvenTransposition([13, 11, 18, 0, -1])
[-1, 0, 11, 13, 18]
>>> OddEvenTransposition([-.1, 1.1, .1, -2.9])
[-2.9, -0.1, 0.1, 1.1]
"""
for i in range(0, len(arr)): for i in range(0, len(arr)):
for i in range(i % 2, len(arr) - 1, 2): for i in range(i % 2, len(arr) - 1, 2):
if arr[i + 1] < arr[i]: if arr[i + 1] < arr[i]:
arr[i], arr[i + 1] = arr[i + 1], arr[i] arr[i], arr[i + 1] = arr[i + 1], arr[i]
print(*arr)
return arr return arr
# creates a list and sorts it
def main():
list = []
for i in range(10, 0, -1):
list.append(i)
print("Initial List")
print(*list)
list = OddEvenTransposition(list)
print("Sorted List\n")
print(*list)
if __name__ == "__main__": if __name__ == "__main__":
main() arr = list(range(10, 0, -1))
print(f"Original: {arr}. Sorted: {OddEvenTransposition(arr)}")