Branchless Bound
I don't need branches, I've got the power of two!
In this game, you play as a code master trying to perfect the 'Shar's algorithm'. You must work your way through a series of levels, each with a different array and search value, and try to optimize the algorithm for maximum speed and efficiency. But beware, the comparison function is provided by the user and can significantly impact the performance of the algorithm. Can you become the ultimate code master and create the fastest binary search algorithm in the world?
