The simplest Java page-splitting algorithm

pagination | The algorithm defines two vectors, one for storing the totalv of all records, the other for storing the records of the current page Currentpagev;
Total number of records: int totalsize = Totalv.getsize ();
Number of records displayed per page: int countperpage;
Total pages: int totalpagenum = totalsize/countperpage;
If the total number of records and the remainder of the records per page is greater than 0,
Then the total number of pages for their divisible result plus a
if (Totalsize%countperpage > 0) {
Totalpagenum = totalsize/countperpage + 1;
}
Current number of pages: Pagenum;

for (int j = 0;j<totalv.size (); j + +) {
Paging, taking records from TOTALV based on the current number of pages and how many records are displayed per page
Add a record to the Currentpagev;
If the current record is on (current page 1) * Display the number of records per page (including equals)
and the current page number * Each page shows the number of records (excluding equals) between the time;
Data that belongs to the page
if ((J >= (pageNum-1) * countperpage) && (J < Pagenum * Countperpage)) {
Currentpagev.addelement (Totalv.get (j));
}
When the number of Currentpagev records equals the number of records displayed per page,
Stop adding records to Currentpagev
if (currentpagev.size () = = Countperpage) {
Break
}
}
The record that is displayed in the current page, then, is the record in the Currentpagev.