Always Knowing the Smallest
Last timeWide Trees and the Disk
Some collections are never searched. They are asked for their smallest item, over and over, and a structure that promises only that is simpler and faster than one that promises order.
Everything so far has kept full order, because the questions needed it. Some
collections are asked only one question, and that question can be answered far
more cheaply.
The lesson stops here
1 more paragraph to go
You have read the opening. The rest of the argument, the problems that check whether it landed, and the lines worth keeping at the end all come with a plan.
The first lesson of every course in the library reads the whole way through, free, so you can see exactly what the rest of them are.
See the planThe contentsThis is the reading half
Starting the course gives you your own copy of it. Every idea on every page has problems standing under it, marked with a reason rather than a tick, and any sentence you do not believe can be opened and argued with. None of that can happen on a page nobody owns.
The contents