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

	Commit message (Collapse)	Author	Age
*	modernize plotting a bit	Egor Tensin	2023-11-29
\| \| \| \|	Use the "object-oriented" interface, fix image size, etc.
*	pylint/pep8 fixes	Egor Tensin	2019-12-23
\|
*	algorithms.inputgen -> algorithms.input_kind	Egor Tensin	2017-05-29
\|
*	mostly Pylint fixes	Egor Tensin	2017-01-12
\|
*	fix licensing notices	Egor Tensin	2016-10-01
\|
*	quicksort: seed RNG	Egor Tensin	2016-06-26
\|
*	add heuristic to derive time units	Egor Tensin	2016-06-25
\|
*	scientific notation by default in plots	Egor Tensin	2016-06-25
\|
*	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.
*	median: quicksort instead of .sort()	Egor Tensin	2016-04-17
\|
*	selection_sort: fix codename	Egor Tensin	2016-04-17
\|
*	implement median value calculation	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.