tree f3305b9a78821e25e6653b7a747495687d235540
parent 5b43ad7779e9b68101a61e90c54211ddee3b8a6d
author Nate Bosch <nbosch@google.com> 1653490354 -0700
committer GitHub <noreply@github.com> 1653490354 -0700
gpgsig -----BEGIN PGP SIGNATURE-----
 
 wsBcBAABCAAQBQJijkKyCRBK7hj4Ov3rIwAA4kwIAINNSBuhutIl2CJcDJThKFIm
 8sfl3kSR+pXGhvKzQSNk0wtT3eF60haA+KVuHIWbK9M6JCZZfT77smYe3pV5n78+
 SA07d8g9coE1JrYhwL0oSvKcWnfHCfGmflKjZkmS4waZ2DZMP8QnkGbdAzhvDNNm
 EyqXvkPUN2TmwrHUnQQD52pqzLM6wjVxDZ/AJxQ3oaqIR35VhRuJxbbZ/Vbkqx44
 QVKeq57Fh3puqyPWZyk4vlEaSDCs0VMlTZKyQ08HBa9Ow/MSgM558V73SgwsTn05
 JVgdopDG61HnoKzxqDZzWkupJXlGsCa6lnewGjTiFF1bKdTbqhmwg22SU3pJGLI=
 =cPey
 -----END PGP SIGNATURE-----
 

Add complexity bound on binary search methods (#239)

Closes #237

In each of the list extensions that mention "Uses binary search" add a
sentence documenting that the search takes `log(n)` comparisons.
Add a sentence about using binary search and the runtime to the top
level algorithm methods.