| Commit message (Collapse) | Author | ||
|---|---|---|---|
| 2019-12-23 | pylint/pep8 fixes | Egor Tensin | |
| 2017-05-29 | algorithms.inputgen -> algorithms.input_kind | Egor Tensin | |
| 2017-01-12 | mostly Pylint fixes | Egor Tensin | |
| 2016-10-01 | fix licensing notices | Egor Tensin | |
| 2016-06-26 | quicksort: seed RNG | Egor Tensin | |
| 2016-06-25 | add heuristic to derive time units | Egor Tensin | |
| 2016-06-25 | scientific notation by default in plots | Egor Tensin | |
| 2016-06-24 | major refactoring | Egor Tensin | |
| With the focus on (re)usability. That includes adding separate modules for plotting, input generation and things like that. | |||
| 2016-04-17 | 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 | |
| * 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. | |||
 |
index : sorting-algorithms | |
| Getting the hang out of (sorting) algorithms | Egor Tensin |
| aboutsummaryrefslogtreecommitdiffstatshomepage |