title: Algorithms, upper/lower bounds, and best/worst case
body: <p>For algorithms, how are the bounds related to best/worst cases? Is the worst case synonymous with upper bound, and best case synonymous with lower bound? Or can you at least derive one from the other? Or are they not related at all?</p>