sorting-algorithms - Getting the hang out of (sorting) algorithms

	Commit message (Collapse)	Author	Age
*	major refactoring	Egor Tensin	2016-06-24
\| \| \| \| \| \|	With the focus on (re)usability. That includes adding separate modules for plotting, input generation and things like that.
*	add Pylint configuration	Egor Tensin	2016-06-24
\|
*	README update	Egor Tensin	2016-05-23
\|
*	rename the project	Egor Tensin	2016-05-19
\|
*	add .gitattributes	Egor Tensin	2016-04-20
\|
*	README update	Egor Tensin	2016-04-18
\|
*	refactoring + better plot captions	Egor Tensin	2016-04-17
\|
*	median: quicksort instead of .sort()	Egor Tensin	2016-04-17
\|
*	selection_sort: fix codename	Egor Tensin	2016-04-17
\|
*	README update	Egor Tensin	2016-04-17
\|
*	implement median value calculation	Egor Tensin	2016-04-17
\|
*	README update	Egor Tensin	2016-04-17
\|
*	rearrange source files	Egor Tensin	2016-04-17
\| \| \| \| \| \| \|	* Add a useful `algorithms` package to provide convinient access to the implemented algorithms. * This allows to e.g. dynamically list available algorithms, which greatly simplifies a lot of things.
*	README update	Egor Tensin	2016-03-09
\|
*	refactoring	Egor Tensin	2016-03-08
\|
*	README update	Egor Tensin	2015-07-12
\|
*	initial commit	Egor Tensin	2015-05-06