]> git.dkaiser.de - 42/push_swap.git/commit
projects / 42 / push_swap.git / commit
? search:
summary | shortlog | log | commit | commitdiff | tree
(parent: 05e786d) | patch
Add inefficient quicksort? algorithm
authorDominik Kaiser <dominik@dominik-XPS.fritz.box>
Mon, 15 Apr 2024 22:01:47 +0000 (00:01 +0200)
committerDominik Kaiser <dominik@dominik-XPS.fritz.box>
Mon, 15 Apr 2024 22:01:47 +0000 (00:01 +0200)
commitf421b2dcf9a5d12655e48f4a06f35f17e785fb0f
treefd27f598757f59db733079b9facc693b6c3ec5c8tree | snapshot
parent05e786db0ae74da69012e1b5aa2dc9169e56723bcommit | diff
Add inefficient quicksort? algorithm

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.
main.c diff | blob | history
sorting.c diff | blob | history