| Age | Commit message (Collapse) | Author | |
|---|---|---|---|
| 2024-04-17 | Change to 3-way radixsort | Dominik Kaiser | |
| Instead of splitting into 2 sets, radixsort will split into 3. Currently one set is half and the other two each a quarter. Probably the efficiency could be increased by 3 equal partitions. Will look into that later. | |||
| 2024-04-16 | Add radixsort for new data system | Dominik Kaiser | |
| 2024-04-16 | Simplify arguments into t_psdata | Dominik Kaiser | |
| 2024-04-16 | Revert "Add inefficient quicksort? algorithm" | Dominik Kaiser | |
| This reverts commit f421b2dcf9a5d12655e48f4a06f35f17e785fb0f. | |||
| 2024-04-16 | Add inefficient quicksort? algorithm | Dominik Kaiser | |
| This algorithm is based on quicksort but probably not really in its spirit. It is extremely inefficient but could maybe fixed with some post-optimization. | |||
| 2024-04-15 | Change stacks from linked lists to rotating arrays | Dominik Kaiser | |
| 2024-04-13 | Create function for step-by-step sorting | Dominik Kaiser | |
| 2024-04-13 | Add cmd optimization | Dominik Kaiser | |
| After the sorting algorithm was executed remove unneccessary commands. | |||
| 2024-04-13 | Add radixsort | Dominik Kaiser | |
| 2024-04-13 | Add sorting function (without any sorting yet) | Dominik Kaiser | |
 |
index : push_swap | |
| Sorting challenge solved in C at 42 Heilbronn |
| summaryrefslogtreecommitdiff |