The following java code is just a pseudo. This is my approach to make a paging link. If ( currentPage = totalPages and totalPages > 3 ) If ( currentPage != 1 and currentPage != totalPages ) Imagine each place we place a page number, Prev or Next as a function call that will return the correct URL.) function printPageLinksFirstTry(num totalPages, num currentPage) Let's ignore the edge case of a single page and make a good first attempt at the algorithm: (As has been mentioned, the code to actually print out the links would be more complicated. If we're not on the last page, display link to Next.Always display the page before this page, and the page after this page.If we're not on the first page, display link to Prev.The algorithm seems to have these traits in common: Let's generalize based on what we've seen: 3 4'įinally let's look at the general case, N pages: ' 1 2 3. Interestingly, we can see that Stack Overflow itself doesn't handle this edge case very well: it should display ' 1 2. We see: ' 1 2 Next' or 'Prev 1 2', depending on which page we're on.ģ pages? ' 1 2 3. How about 2 pages? Find a tag that has between 11 and 20 entries ( emacs works today). We can see nothing is displayed, which makes sense. Each of my pages displays 10 results, so to find out what it does for 1 page, find a tag that has less than 11 entries: usability works today. There are several other answers already, but I'd like to show you the approach I took to solve it:įirst, let's check out how Stack Overflow handles normal cases and edge cases.

Algorithm pseudocode examples