QuickSort is a Divide and Conquer algorithm. Quick sort is a very efficient sorting algorithm. In Quick Sort an array is partitioned into two arrays one of which holds values smaller than the specified value, say pivot, based on which the partition is made and another array holds values greater than the pivot value.
This is an on-the-spot comparison-based sorting algorithm. In this sort a sub-list is maintained which is always sorted. For example, the lower part of an array is maintained to be sorted. It is named insertion sort as an element which is to be 'insert'ed in this sorted sub-list, has to find its appropriate place and then it has to be inserted there.
Bubble Sort is the simplest sorting algorithm that can be done by repeatedly swapping the adjacent elements if they are in wrong order. It is named as bubble sort since it looks like bubbles the lighter elements come up and heavier elements settle down.
Most of us know the power of pagination when there is large data. Mostly we pass items-per-page and page-number as parameter to a server side method and returns items equal to items-per-page using skip/take mechanism. we always used a quick and dirty implementation. This article will help you to generate optimized pagination in a general solution.