algorithm/Python
1
0
Fork 0
mirror of https://github.com/TheAlgorithms/Python.git synced 2025-07-25 17:32:36 +08:00
Code Issues Packages Projects Releases Wiki Activity

Adding unit tests for sorting functions, and improving readability on some sorting algorithms (#784)

Browse Source 
* Adding variable to fade out ambiguity

* More readability on merge sorting algorithm

* Updating merge_sort_fastest description and explaining why

* Adding tests file with imports

* Standardazing filenames and function names

* Adding test cases and test functions

* Adding test loop

* Putting 'user oriented code' inside main condition for having valid imports

* Fixing condition

* Updating tests: adding cases and todo list

* Refactoring first euler problem's first solution
This commit is contained in:
Mehdi ALAOUI
2019-05-25 15:41:24 +02:00
committed by John Law
parent 9f982a83c8
commit 02c0daf9e5
14 changed files with 119 additions and 47 deletions
Download Patch File Download Diff File Expand all files Collapse all files

2
sorts/merge_sort_fastest.py
View File

@ -2,7 +2,7 @@
Python implementation of the fastest 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)
Worst Case Scenario : O(n^2) because native python functions:min, max and remove are already O(n)
'''
from __future__ import print_function