From edded2dcdc974781489aa4c2b9dcff33adbb87ae Mon Sep 17 00:00:00 2001 From: Bardia Alavi Date: Wed, 4 Dec 2019 22:27:10 -0500 Subject: [PATCH] address merge_soft duplicate files Here the old file merge_sort_fastest is renamed to unknown_sort. Because it is not merge sort algorithm. Comments are updated accordingly. --- sorts/{merge_sort_fastest.py => unknown_sort.py} | 3 +-- 1 file changed, 1 insertion(+), 2 deletions(-) rename sorts/{merge_sort_fastest.py => unknown_sort.py} (88%) diff --git a/sorts/merge_sort_fastest.py b/sorts/unknown_sort.py similarity index 88% rename from sorts/merge_sort_fastest.py rename to sorts/unknown_sort.py index f3c067795dd5..087533b4a575 100644 --- a/sorts/merge_sort_fastest.py +++ b/sorts/unknown_sort.py @@ -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) """