push_swap/main.c, branch quicksortSorting challenge solved in C at 42 Heilbronn
https://git.dkaiser.de/42/push_swap/atom?h=quicksort2024-04-16T11:16:20ZAdd some optimization2024-04-16T11:16:20ZDominik Kaiser2024-04-16T11:16:20Zurn:sha1:321cd3e03788cb1f077268d84f8c0c064fadb2aeAdjust optimize_commands() for t_psdata2024-04-16T08:35:22ZDominik Kaiser2024-04-16T08:35:22Zurn:sha1:711092a83e3ee80e7a9d6d826b4158f799fcb358Adjust main to correctly use and free data2024-04-16T07:36:40ZDominik Kaiser2024-04-16T07:36:40Zurn:sha1:50e53dbdf4e6e6ec7d1514cc44fa06e689a584b7Simplify arguments into t_psdata2024-04-16T07:28:12ZDominik Kaiser2024-04-16T07:28:12Zurn:sha1:b0db3b8a7c4dd03c759fb88bed7d5ce1d41a6059Revert "Add inefficient quicksort? algorithm"2024-04-15T22:13:14ZDominik Kaiser2024-04-15T22:13:14Zurn:sha1:4f288f94c8ec8ced5200d2e4e5713d9b119aed48
This reverts commit f421b2dcf9a5d12655e48f4a06f35f17e785fb0f.
Add inefficient quicksort? algorithm2024-04-15T22:01:47ZDominik Kaiser2024-04-15T22:01:47Zurn: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 arrays2024-04-15T15:54:43ZDominik Kaiser2024-04-15T15:54:43Zurn:sha1:4545c9f4dc339e94bf6ebe0963db55e9dcc131bdAdd cmd optimization2024-04-13T15:49:06ZDominik Kaiser2024-04-13T15:49:06Zurn:sha1:5427f29f7f8b4a6691330c2fc8a1c24027d8fe71
After the sorting algorithm was executed remove unneccessary commands.
Add empty stack_optimize function2024-04-13T13:32:45ZDominik Kaiser2024-04-13T13:32:45Zurn:sha1:40025011f834660beba759864f3f59552acbeecdAdd radixsort2024-04-13T13:31:29ZDominik Kaiser2024-04-13T13:31:29Zurn:sha1:9674332f03f434534017c0f70f3c213fa4ebb2bf