mathdatech/Python
1
0
Fork 0
mirror of https://github.com/TheAlgorithms/Python.git synced 2024-11-27 15:01:08 +00:00
Code Issues Packages Projects Releases Wiki Activity

address merge_soft duplicate files (#1612)

Browse Source 
Here the old file merge_sort_fastest is renamed to unknown_sort. Because it is not merge sort algorithm.

Comments are updated accordingly.
This commit is contained in:
Bardia Alavi 2019-12-04 23:06:41 -05:00 committed by Christian Clauss
parent caad74466a
commit 494fb4fb49
1 changed files with 1 additions and 2 deletions
Show Stats Download Patch File Download Diff File Expand all files Collapse all files

3
sorts/merge_sort_fastest.py → sorts/unknown_sort.py
View File

@ -1,6 +1,5 @@
""" """
Python implementation of the fastest merge sort algorithm. Python implementation of a sort algorithm.
Takes an average of 0.6 microseconds to sort a list of length 1000 items.
Best Case Scenario : O(n) Best Case Scenario : O(n)
Worst Case Scenario : O(n^2) because native python functions:min, max and remove are already O(n) Worst Case Scenario : O(n^2) because native python functions:min, max and remove are already O(n)
""" """