push_swap/sorting.c, branch scoresortSorting challenge solved in C at 42 Heilbronn
https://git.dkaiser.de/42/push_swap/atom?h=scoresort2024-04-24T13:04:10ZAdd is_sorted2024-04-24T13:04:10ZDominik Kaiser2024-04-24T13:04:10Zurn:sha1:2d6275bad3467b01db64a5d6dcf74d746d10d657Make norminette happy and some more error handling2024-04-24T12:59:53ZDominik Kaiser2024-04-24T12:59:53Zurn:sha1:173279d8e83e81fd1d451adb2153103dc0506ad8Norminette formatting2024-04-24T09:08:34ZDominik Kaiser2024-04-24T09:08:34Zurn:sha1:a931d6df9fd873607442a70351fbb7e0f32590d0Finally fix sorting2024-04-17T13:49:14ZDominik Kaiser2024-04-17T13:49:14Zurn:sha1:6d5af57b81b1d180c5e0c0d8e363553771b72455
Unfortunately the performance is not good right now,
but this should be rather easy to fix.
Change sorting direction (still not fully working)2024-04-17T12:19:37ZDominik Kaiser2024-04-17T12:19:37Zurn:sha1:cd2231f596dd945dbf37e7d7b260d6d8950ffce7
Somehow the 0 is still not sorted and in some cases 1 as well.
TODO: Fix this
Add movement (with some bugs)2024-04-17T10:21:25ZDominik Kaiser2024-04-17T10:21:25Zurn:sha1:b0a8aaeddfc5feb8a55d16891e199f635291c66a
TODO: Fix sorting direction. Right now the numbers are sorted max ->
min instead of min -> max.
TODO: Fix sorting bug. Some numbers are not sorted.
Add score calculation2024-04-17T09:51:17ZDominik Kaiser2024-04-17T09:51:17Zurn:sha1:26e76f9d7ad46948b0548c41375f81cacf20b47cAdd presorting2024-04-17T08:51:01ZDominik Kaiser2024-04-17T08:51:01Zurn:sha1:61c619f2d24cadd53defe1cfa74b71f644c49010
All entries that are not in order will be pushed into b.
If the entry is larger than our pivot, it will be pushed to the bottom,
else the top of b.
Simplify 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.