iframe-proxy | Sunbelt Computer Software

History

50 lines (39 loc) · 1.28 KB

Raw

"""

This is a pure python implementation of the quick sort algorithm

For doctests run following command:

python -m doctest -v quick_sort.py

python3 -m doctest -v quick_sort.py

For manual testing run:

python quick_sort.py

"""

from __future__ import print_function

def quick_sort(ARRAY):

"""Pure implementation of quick sort algorithm in Python

:param collection: some mutable ordered collection with heterogeneous

comparable items inside

:return: the same collection ordered by ascending

Examples:

>>> quick_sort([0, 5, 3, 2, 2])

[0, 2, 2, 3, 5]

>>> quick_sort([])

[]

>>> quick_sort([-2, -5, -45])

[-45, -5, -2]

"""

ARRAY_LENGTH = len(ARRAY)

if( ARRAY_LENGTH <= 1):

return ARRAY

else:

PIVOT = ARRAY[0]

GREATER = [ element for element in ARRAY[1:] if element > PIVOT ]

LESSER = [ element for element in ARRAY[1:] if element <= PIVOT ]

return quick_sort(LESSER) + [PIVOT] + quick_sort(GREATER)

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:\n').strip()

unsorted = [ int(item) for item in user_input.split(',') ]

print( quick_sort(unsorted) )

Sunbelt Computer Software

PL/B Language Development and Support

Navigation Menu

Sunbelt Computer Software

PL/B Language Development and Support

FilesExpand file tree

quick_sort.py

Latest commit

History

quick_sort.py

File metadata and controls