Current Slide

Small screen detected. You are viewing the mobile version of SlideWiki. If you wish to edit slides you will need to use a larger device.

Sorting 10 blocks of 10M records

  • First, read each block and sort within:

    • Quicksort takes 2N ln N expected steps

    • In our case 2 x (10M ln 10M) steps

  • Exercise: estimate total time to read each block from disk and and quicksort it.

  • 10 times this estimate – gives us 10 sorted runs of 10M records each.

  • Done straightforwardly, need 2 copies of data on disk

    • But can optimize this

Speaker notes:

Content Tools


There are currently no sources for this slide.