4 Commits

Author	SHA1	Message	Date
Tommy.Liu	3c40fda6a3	More elegant coding for merge_sort_fastest (#804) ... * More elegant coding for merge_sort_fastest * More elegant coding for merge_sort	2019-05-14 18:17:25 +08:00
Harshil	71fd719ab7	Update merge_sort_fastest.py	2018-05-21 10:28:37 +02:00
Harshil	7f4b240d1a	Update merge_sort_fastest.py ... I have modified the code a little to make it work as expected!	2018-05-21 10:21:33 +02:00
Syed Haseeb Shah	237df47a31	Create merge_sort_fastest.py ... Python implementation of merge sort algorithm. Takes an average of 0.6 microseconds to sort a list of length 1000 items. Best Case Scenario : O(n) Worst Case Scenario : O(n)	2018-05-20 23:00:17 +05:00