Finally, we will study the priority queue data structure and showcase some applications. We will go through the quicksort and quickselect algorithms for sorting and selecting the kth smallest element ...

and show how to reduce the cycle count of the bubble sort and merge sort algorithm. In addition we look at methods to accelerate the sorting of data that is wider than the register width of the ...