2 Commits

Author	SHA1	Message	Date
FrogBattle	e58a5e6842	Update tim_sort.py (#972) ... * Update tim_sort.py Update tim_sort.py The previous algorithm was skipping numbers, according to issue #959, and my own tests. The version I am applying uses a while loop, which works correctly and is easier to compute, as there is no break statement. * Update tim_sort.py	2019-07-30 18:06:48 +02:00
Mehdi ALAOUI	02c0daf9e5	Adding unit tests for sorting functions, and improving readability on some sorting algorithms (#784) ... * 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	2019-05-25 21:41:24 +08:00