Order statistics Select the ith smallest of n elements(the element with rank i i=l: minimum, .i=n: marimum, i=L(n+1)/2]or[(n+1)/2 median Naive algorithm: Sort and index ith element Worst-case running time =o(n Ig n)+o(1 o(nIg n using merge sort or heapsort(not quicksort) c 2001 by Charles E Leiserson
Computer System Operation A modern computer system System boot Interrupt I/O Structure I/O Structure I/O operation DMA Storage Structure and Storage Hierarchy Storage Structure Storage hierarchy Hardware Protection Hardware Protection General System Architecture General System Architecture system call Computing Environments