~dmarino/ucf/bhcsi/lectures/adv Programming Contest Preparation Useful Libraries and Information ~dmarino/ucf/transparency/cgs1060/notes Chapter 3 Notes Application Software ~dmarino/ucf/cop3503/fall04H/lectures Detailed Analysis of the Binary Search As established in cs1, the best-case running time of a binary search of n elements is O(1), corresponding to when we find the element for which we are looking on our first comparison directory ~dmarino ucf |