push_swap/sorting.c, branch new_radixsortSorting challenge solved in C at 42 Heilbronn
https://git.dkaiser.de/42/push_swap/atom?h=new_radixsort2024-04-17T07:48:09ZChange to 3-way radixsort2024-04-17T07:48:09ZDominik Kaiser2024-04-17T07:48:09Zurn:sha1:c0537681539794755df7b0be610b0fa7706411ba
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.
Add radixsort for new data system2024-04-16T15:59:00ZDominik Kaiser2024-04-16T15:59:00Zurn:sha1:5f3cc5b96b8b30a46051081403a6ac9210aee6afSimplify 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:4545c9f4dc339e94bf6ebe0963db55e9dcc131bdCreate function for step-by-step sorting2024-04-13T18:01:38ZDominik Kaiser2024-04-13T18:01:38Zurn:sha1:3d5057371652145189cbf643d99f8628932e1615Add cmd optimization2024-04-13T15:49:06ZDominik Kaiser2024-04-13T15:49:06Zurn:sha1:5427f29f7f8b4a6691330c2fc8a1c24027d8fe71
After the sorting algorithm was executed remove unneccessary commands.
Add radixsort2024-04-13T13:31:29ZDominik Kaiser2024-04-13T13:31:29Zurn:sha1:9674332f03f434534017c0f70f3c213fa4ebb2bfAdd sorting function (without any sorting yet)2024-04-13T13:09:19ZDominik Kaiser2024-04-13T13:09:19Zurn:sha1:9585e1d336c6a1581b335798762172314de1fefb