computational complexity fig common big-oh complexities as possible as each of these techniques are exploredyou'll also have the opportunity to write some fun programs and you'll learn good deal about object-oriented programming more asymptotic notation earlier in this we developed big-oh notation for describing an upper bound on the complexity of an algorithm there we began with an intuitive understanding of the idea of efficiency saying that function exhibits complexity if it is bounded above by function of where represents the size of the data given to the algorithm in this section we further develop these concepts to bound the efficiency of an algorithm from both above and below we begin with an in-depth discussion of efficiency and the measurement of it in computer science when concerning ourselves with algorithm efficiency there are two issues that must be considered this copy belongs to 'acha