X-Git-Url: http://lambda.jimpryor.net/git/gitweb.cgi?p=lambda.git;a=blobdiff_plain;f=week4.mdwn;h=bc154aea1195830c5858a716055ec250c4229a3e;hp=f92ea169d4e09cc67c097cb104be303328dd607f;hb=5fa25870987fce498870f06907422cee6a0bb8b1;hpb=0ba095c6cd0331481a1454283ceeb14be690b5b8;ds=sidebyside diff --git a/week4.mdwn b/week4.mdwn index f92ea169..bc154aea 100644 --- a/week4.mdwn +++ b/week4.mdwn @@ -250,7 +250,7 @@ So, if we were searching the list that implements some set to see if the number we can stop. If we haven't found `5` already, we know it's not in the rest of the list either. -This is an improvement, but it's still a "linear" search through the list. +*Comment*: This is an improvement, but it's still a "linear" search through the list. There are even more efficient methods, which employ "binary" searching. They'd represent the set in such a way that you could quickly determine whether some element fell in one half, call it the left half, of the structure that @@ -260,7 +260,7 @@ determination could be made for whichever half you were directed to. And then for whichever quarter you were directed to next. And so on. Until you either found the element or exhausted the structure and could then conclude that the element in question was not part of the set. These sorts of structures are done -using **binary trees** (see below). +using [binary trees](/implementing_trees). #Aborting a search through a list#