push_swap, branch new_radixsortSorting challenge solved in C at 42 Heilbronn
https://git.dkaiser.de/42/push_swap/atom?h=new_radixsort2024-04-17T08:02:48ZMerge pull request #7 from dpu-kaiser/master2024-04-17T08:02:48ZDominik Kaiser2024-04-17T08:02:48Zurn:sha1:7ee7febc315ad4f0b8bc07dc4298fa01ea22aac9
Add changes from master to new_radixsortMerge pull request #6 from dpu-kaiser/add_2op_optimization2024-04-17T08:01:51ZDominik Kaiser2024-04-17T08:01:51Zurn:sha1:ca291232e5716bc277b4d56c7a76dac2f8caa860
Add optimization for double stack opsMerge branch 'master' into add_2op_optimization2024-04-17T08:00:27ZDominik Kaiser2024-04-17T08:00:27Zurn:sha1:09176f10ff4fbde374825a064241cdc3ff163623Add optimization for double stack ops2024-04-17T07:53:13ZDominik Kaiser2024-04-17T07:53:13Zurn:sha1:c16af7775f6d4bb56bb8a0891ec646032f442993
Now RA and RB will be optimized to RR
Change 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.
Merge pull request #5 from dpu-kaiser/master2024-04-16T16:21:50ZDominik Kaiser2024-04-16T16:21:50Zurn:sha1:5ae6bcfed569e323a6a628636f4fcf92740d2ae0
Merge changes from master into new_radixsortMerge pull request #4 from dpu-kaiser/refactor-cmd_optimization2024-04-16T16:20:57ZDominik Kaiser2024-04-16T16:20:57Zurn:sha1:ca607daf01f965a0a07263f57cdc1274e3a24fe8
Refactor cmd_optimizationRefactor cmd_optimization2024-04-16T16:10:54ZDominik Kaiser2024-04-16T16:10:54Zurn:sha1:b8be1fba75a133b159b71a5c3c06436a143e670fAdd radixsort for new data system2024-04-16T15:59:00ZDominik Kaiser2024-04-16T15:59:00Zurn:sha1:5f3cc5b96b8b30a46051081403a6ac9210aee6afMerge pull request #2 from dpu-kaiser/simplify-args2024-04-16T07:38:38ZDominik Kaiser2024-04-16T07:38:38Zurn:sha1:571c2f537954fd0d5deb616380276d1d23049aa9
Simplify args