<?php
function paginateArray($array, $currentPage, $itemsPerPage) {
$totalItems = count($array);
$totalPages = ceil($totalItems / $itemsPerPage);
// Ensure current page is within bounds
if ($currentPage < 1) $currentPage = 1;
if ($currentPage > $totalPages) $currentPage = $totalPages;
$startIndex = ($currentPage - 1) * $itemsPerPage;
return array_slice($array, $startIndex, $itemsPerPage);
}
// Example usage
$data = range(1, 100); // An array of numbers from 1 to 100
$currentPage = 2; // Current page number
$itemsPerPage = 10; // Number of items per page
$paginatedData = paginateArray($data, $currentPage, $itemsPerPage);
print_r($paginatedData);
?>
How do I avoid rehashing overhead with std::set in multithreaded code?
How do I find elements with custom comparators with std::set for embedded targets?
How do I erase elements while iterating with std::set for embedded targets?
How do I provide stable iteration order with std::unordered_map for large datasets?
How do I reserve capacity ahead of time with std::unordered_map for large datasets?
How do I erase elements while iterating with std::unordered_map in multithreaded code?
How do I provide stable iteration order with std::map for embedded targets?
How do I provide stable iteration order with std::map in multithreaded code?
How do I avoid rehashing overhead with std::map in performance-sensitive code?
How do I merge two containers efficiently with std::map for embedded targets?