push_swap/main.c, branch master Sorting challenge solved in C at 42 Heilbronn https://git.dkaiser.de/42/push_swap/atom?h=master 2024-04-17T08:00:27Z Merge branch 'master' into add_2op_optimization 2024-04-17T08:00:27Z Dominik Kaiser 2024-04-17T08:00:27Z urn:sha1:09176f10ff4fbde374825a064241cdc3ff163623 Add optimization for double stack ops 2024-04-17T07:53:13Z Dominik Kaiser 2024-04-17T07:53:13Z urn:sha1:c16af7775f6d4bb56bb8a0891ec646032f442993 Now RA and RB will be optimized to RR Refactor cmd_optimization 2024-04-16T16:10:54Z Dominik Kaiser 2024-04-16T16:10:54Z urn:sha1:b8be1fba75a133b159b71a5c3c06436a143e670f Adjust main to correctly use and free data 2024-04-16T07:36:40Z Dominik Kaiser 2024-04-16T07:36:40Z urn:sha1:50e53dbdf4e6e6ec7d1514cc44fa06e689a584b7 Simplify arguments into t_psdata 2024-04-16T07:28:12Z Dominik Kaiser 2024-04-16T07:28:12Z urn:sha1:b0db3b8a7c4dd03c759fb88bed7d5ce1d41a6059 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 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. Add empty stack_optimize function 2024-04-13T13:32:45Z Dominik Kaiser 2024-04-13T13:32:45Z urn:sha1:40025011f834660beba759864f3f59552acbeecd