push_swap/sorting.c, branch quicksort Sorting challenge solved in C at 42 Heilbronn https://git.dkaiser.de/42/push_swap/atom?h=quicksort 2024-04-16T11:16:20Z Add some optimization 2024-04-16T11:16:20Z Dominik Kaiser 2024-04-16T11:16:20Z urn:sha1:321cd3e03788cb1f077268d84f8c0c064fadb2ae Fix merge errors 2024-04-16T07:56:02Z Dominik Kaiser 2024-04-16T07:56:02Z urn:sha1:49c0aa0bcda83ca590403a62b80e20b28d53c195 Merge branch 'quicksort' into merge-master-into-quicksort 2024-04-16T07:51:49Z Dominik Kaiser 2024-04-16T07:51:49Z urn:sha1:a596331e31bf46d5083e1486b240fbcc76bc908e Simplify arguments into t_psdata 2024-04-16T07:28:12Z Dominik Kaiser 2024-04-16T07:28:12Z urn:sha1:b0db3b8a7c4dd03c759fb88bed7d5ce1d41a6059 Try again to add this algorithm 2024-04-15T22:15:03Z Dominik Kaiser 2024-04-15T22:15:03Z urn:sha1:05ed24cc61175dd74056bd0b2ecd509b995784f8 Hopefully this time I put it in the correct branch. Revert "Add inefficient quicksort? algorithm" 2024-04-15T22:13:14Z Dominik Kaiser 2024-04-15T22:13:14Z urn:sha1:4f288f94c8ec8ced5200d2e4e5713d9b119aed48 This reverts commit f421b2dcf9a5d12655e48f4a06f35f17e785fb0f. Add inefficient quicksort? algorithm 2024-04-15T22:01:47Z Dominik Kaiser 2024-04-15T22:01:47Z urn:sha1:f421b2dcf9a5d12655e48f4a06f35f17e785fb0f 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. Change stacks from linked lists to rotating arrays 2024-04-15T15:54:43Z Dominik Kaiser 2024-04-15T15:54:43Z urn:sha1:4545c9f4dc339e94bf6ebe0963db55e9dcc131bd Create function for step-by-step sorting 2024-04-13T18:01:38Z Dominik Kaiser 2024-04-13T18:01:38Z urn:sha1:3d5057371652145189cbf643d99f8628932e1615 Add cmd optimization 2024-04-13T15:49:06Z Dominik Kaiser 2024-04-13T15:49:06Z urn:sha1:5427f29f7f8b4a6691330c2fc8a1c24027d8fe71 After the sorting algorithm was executed remove unneccessary commands.