mirror of
https://github.com/TheAlgorithms/Python.git
synced 2025-07-05 01:09:40 +08:00
Move files to separate directories
This commit is contained in:
52
sorts/bubble_sort.py
Normal file
52
sorts/bubble_sort.py
Normal file
@ -0,0 +1,52 @@
|
||||
"""
|
||||
This is pure python implementation of bubble sort algorithm
|
||||
|
||||
For doctests run following command:
|
||||
python -m doctest -v bubble_sort.py
|
||||
or
|
||||
python3 -m doctest -v bubble_sort.py
|
||||
|
||||
For manual testing run:
|
||||
python bubble_sort.py
|
||||
"""
|
||||
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]
|
||||
"""
|
||||
length = len(collection)
|
||||
for i in range(length):
|
||||
for j in range(length-1):
|
||||
if collection[j] > collection[j+1]:
|
||||
collection[j], collection[j+1] = collection[j+1], collection[j]
|
||||
|
||||
return collection
|
||||
|
||||
|
||||
if __name__ == '__main__':
|
||||
import sys
|
||||
# For python 2.x and 3.x compatibility: 3.x has not raw_input builtin
|
||||
# otherwise 2.x's input builtin function is too "smart"
|
||||
if sys.version_info.major < 3:
|
||||
input_function = raw_input
|
||||
else:
|
||||
input_function = input
|
||||
|
||||
user_input = input_function('Enter numbers separated by coma:\n')
|
||||
unsorted = [int(item) for item in user_input.split(',')]
|
||||
print(bubble_sort(unsorted))
|
Reference in New Issue
Block a user