address merge_soft duplicate files (#1612)

Here the old file merge_sort_fastest is renamed to unknown_sort. Because it is not merge sort algorithm. Comments are updated accordingly.
2019-12-05 05:06:41 +01:00
parent caad74466a
commit 494fb4fb49
1 changed files with 1 additions and 2 deletions
@@ -1,6 +1,5 @@
 """
-Python implementation of the fastest merge sort algorithm.
-Takes an average of 0.6 microseconds to sort a list of length 1000 items.
+Python implementation of a sort algorithm.
 Best Case Scenario : O(n)
 Worst Case Scenario : O(n^2) because native python functions:min, max and remove are already O(n)
 """