mirror of
https://github.com/TheAlgorithms/Python.git
synced 2024-11-30 16:31:08 +00:00
b7f13d991c
* Travis CI: Add type checking with mypy * Create requirements.txt * script: mypy --ignore-missing-stubs=cv2,numpy . * Delete requirements.txt * script: mypy --ignore-missing-imports . * Run doctests * Disable doctest -v other/detecting_english_programmatically.py * Pytest * No | * pytest || true * Run black doctest flake8 mypy pytest * after_success: Build Directory.md * Typo in filename: Dictionary.txt --> dictionary.txt' Discovered via doctest run in #964 * python -m doctest -v * pip install black flake8 mypy pytest * pytest --doctest-glob='*.py' * pytest --doctest-modules * pytest --doctest-modules ./sorts * pytest --doctest-modules ./ciphers ./other ./searches ./sorts ./strings || true * if __name__ == "__main__": * if __name__ == "__main__": * if __name__ == '__main__': * if __name__ == '__main__': * if __name__ == '__main__': * Create requirements.txt * Update requirements.txt * if __name__ == "__main__": * Lose the doctests * if __name__ == '__main__': * Remove print-a-tuple * doctest: Added missing spaces * Update tabu_search.py * The >>> are not doctests so change to >>) * Travis CI: Run black, doctest, flake8, mypy, and pytest * Link to the separate DIRECTORY.md file * Update README.md
43 lines
1.2 KiB
Python
43 lines
1.2 KiB
Python
from __future__ import print_function
|
|
|
|
|
|
def bubble_sort(collection):
|
|
"""Pure implementation of bubble sort algorithm in Python
|
|
|
|
:param collection: some mutable ordered collection with heterogeneous
|
|
comparable items inside
|
|
:return: the same collection ordered by ascending
|
|
|
|
Examples:
|
|
>>> bubble_sort([0, 5, 3, 2, 2])
|
|
[0, 2, 2, 3, 5]
|
|
|
|
>>> bubble_sort([])
|
|
[]
|
|
|
|
>>> bubble_sort([-2, -5, -45])
|
|
[-45, -5, -2]
|
|
|
|
>>> bubble_sort([-23,0,6,-4,34])
|
|
[-23, -4, 0, 6, 34]
|
|
"""
|
|
length = len(collection)
|
|
for i in range(length-1):
|
|
swapped = False
|
|
for j in range(length-1-i):
|
|
if collection[j] > collection[j+1]:
|
|
swapped = True
|
|
collection[j], collection[j+1] = collection[j+1], collection[j]
|
|
if not swapped: break # Stop iteration if the collection is sorted.
|
|
return collection
|
|
|
|
|
|
if __name__ == '__main__':
|
|
try:
|
|
raw_input # Python 2
|
|
except NameError:
|
|
raw_input = input # Python 3
|
|
user_input = raw_input('Enter numbers separated by a comma:').strip()
|
|
unsorted = [int(item) for item in user_input.split(',')]
|
|
print(*bubble_sort(unsorted), sep=',')
|