So now it’s way faster than that C code (why?), but I’m not even sure it’s the limit of speedup.
I was thinking a naive_findmax could be Base, or under findmax with keyword argument (and every time Base isn’t fastest for something, explain faster option available, without taking edge cases into account). But this seems to be a deep rabbit hole and maybe even faster here:
At least document that findmax/min aren’t fastest, and point to alternatives (if not simply adding fastest) likely FindFirstFunctions.jl in their docstrings?