Skip to content

More elegant coding for merge_sort_fastest #804

New issue

Have a question about this project? Sign up for a free GitHub account to open an issue and contact its maintainers and the community.

Sign up for GitHub

By clicking “Sign up for GitHub”, you agree to our terms of service and privacy statement. We’ll occasionally send you account related emails.

Already on GitHub? Sign in to your account

Merged
poyea merged 3 commits into from
May 14, 2019
Merged

More elegant coding for merge_sort_fastest #804

Changes from 1 commit
Commits
Show all changes
3 commits
Select commit Hold shift + click to select a range
d0f3150
Merge pull request #1 from TheAlgorithms/master
liuzhen153 May 14, 2019
2613068
More elegant coding for merge_sort_fastest
May 14, 2019
fe92d18
More elegant coding for merge_sort
May 14, 2019
File filter

Filter by extension

Filter by extension
Conversations
Failed to load comments.
Loading
Jump to
Jump to file
Failed to load files.
Loading
Diff view
Diff view
Prev Previous commit
More elegant coding for merge_sort
  • Loading branch information
liuzhen
liuzhen committed May 14, 2019
commit fe92d18f779df5e996864dc504d94b635548ce00
46 changes: 15 additions & 31 deletions sorts/merge_sort.py
View file
Open in desktop
Original file line number Diff line number Diff line change
Expand Up @@ -29,36 +29,20 @@ def merge_sort(collection):
>>> merge_sort([-2, -5, -45])
[-45, -5, -2]
"""
length = len(collection)
if length > 1:
midpoint = length // 2
left_half = merge_sort(collection[:midpoint])
right_half = merge_sort(collection[midpoint:])
i = 0
j = 0
k = 0
left_length = len(left_half)
right_length = len(right_half)
while i < left_length and j < right_length:
if left_half[i] < right_half[j]:
collection[k] = left_half[i]
i += 1
else:
collection[k] = right_half[j]
j += 1
k += 1

while i < left_length:
collection[k] = left_half[i]
i += 1
k += 1

while j < right_length:
collection[k] = right_half[j]
j += 1
k += 1

return collection
def merge(left, right):
'''merge left and right
:param left: left collection
:param right: right collection
:return: merge result
'''
result = []
while left and right:
result.append(left.pop(0) if left[0] <= right[0] else right.pop(0))
return result + left + right
if len(collection) <= 1:
return collection
mid = len(collection) // 2
return merge(merge_sort(collection[:mid]), merge_sort(collection[mid:]))


if __name__ == '__main__':
Expand All @@ -69,4 +53,4 @@ def merge_sort(collection):

user_input = raw_input('Enter numbers separated by a comma:\n').strip()
unsorted = [int(item) for item in user_input.split(',')]
print(merge_sort(unsorted))
print(*merge_sort(unsorted), sep=',')