Isn't this too smart ?

awesome.

That seems to specifically targeting mathematicians having OCD...

I want to go to page 8.96578428466 please

@12bitfloat what about π ? ,XD

Cool, although I don't see myself wanting to go from page 4 to page 256.

@kamen actually when you open page 4, the pagination steps changes accordingly....... 4 5 6 8 16 .... Something like that.

(It is based on the concept of Binary Search)

That 500 not being 512 hurts.

@Survivor Depending on how it's made, you might actually have 256 two positions to the left when you're on 4.

I get the idea, but why would you need binary search for pages?

What really hurts me is that instead of calculating them programmatically, the coder probably wrote all values by hand. Allowing the horrible conclusion.

@kamen Binary search is way faster than linear searching, so lets say you need to go to 35th page given 1-500, you can reach in minimal steps.

@rov3rand0m yeah, but if it was, the values are not manually added though, devs have applied a beautiful logic to generate that pattern.

You can try that at here - atcoder.jp/ranking

I kind of like it.
Not sure end users would.

@Root ig users loved it, considering it to be a competitive programming website :D

@Survivor I agree about faster searching if you have to click through like that, but depends on what data you're displaying (and why is it so much that you have 500 pages). I can't remember wanting to go to a specific page like that. Maybe I'd only need it if I remember someone said something on page N in a forum thread; otherwise for me it's click prev/next until I get what I want, or search for it directly.

took me a minute to understand it was pagination. I thought it was some online scrum tool or smt

@kamen Quite insightful though.
But i saw that first time so thought of sharing it :)

This is fantastic

512 🙊