fiestasort's Introduction

fiestaSort.c

ridiculous sorting algorithm lol

so a few weeks ago while I was bored I saw at a golf sorting question on the codegolf stackexchange
I can't remember the exact wording, but it more or less said "sort in the fewest number of bytes possible"

I also think the original question had an additional given that each value only appears once in the input,
I didn't take this into account and just wrote it generally tho

but I instead added my own restriction that I'd use C and not use a single for/do/while/if
wild right? xD

I remember some languages were able to do the original question in less than 5 bytes but I don't think that's possible in C lmao
anyway, I originaly wrote this code a while back, but I wasn't using git/github much at that point, might as well upload it now

also iirc, a number of the answers I saw were Bogosorts of some form, kinda just generating each permutation
but this one is provably O(n²) despite having a single mysterious goto
xD

fiestasort's People

Contributors

Watchers

fiestasort's Issues

sz check is incorrect

size_t sz = atoi(...) is unsigned,
checking if (sz > 1) doesnt account for atoi returning a negative value because that shit
just gets reinterpreted as unsigned

there are only 3 arguments lul

don't need > 3 if we know it's == 4 lul

idk why I'm making so many issues lol

could time(NULL) fail?

so the standard man 3p time says that time(NULL) could fail if the time difference would EOVERFLOW,
but man 2 time:

doesn't declare this error
declares a possible EFAULT instead, but not for time(NULL)
says tloc is becoming obsolete and it should always be time(NULL) anyway
says time(NULL) cannot fail

lmfao idk which one should we respect

degenerate arrays CAN be handled

USAGE(sz > 1) is a slick-ish band-aid for the fact that fiestaSort-ing an array with length 1 causes a heap buffer overflow.
we can simply start with j = 0 to fix this

Recommend Projects