Basis Lab

Keeping Things in Order

A Sorted List You Can Change

Last timeHalving the Search

Write the halving down as a tree of comparisons and the structure becomes the search. Insertions then cost one walk down and one link, with nothing shifted along to make room.

The sorted block searches in twenty steps and pays half a million to accept

one new item. The repair is to stop storing the order as positions and start

storing it as comparisons.

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 contents

This 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

The rest of this course

  1. 01Halving the Search
  2. 02A Sorted List You Can Changeyou are here
  3. 03When a Tree Degenerates Into a Listopening only
  4. 04Keeping It Balancedopening only
  5. 05Asking for Everything Betweenopening only
  6. 06Wide Trees and the Diskopening only
  7. 07Always Knowing the Smallestopening only
  8. 08Putting It in Order in the First Placeopening only

Read alongside