let' now examine practical scenario by which means do we arrive at the conclusion that the bubble sort algorithm is slower than the quick sort algorithmor in generalhow do we measure the efficiency of one algorithm against the otherwellwe can compare the big of any number of algorithms to determine their efficiency it is this approach that gives us time measure or the growth ratewhich charts the behavior of the algorithm as gets bigger here is graph of the different runtimes that an algorithm' performance may fall underin ascending orderthe list of runtimes from better to worse is given as ( ) (log ) ( ) ( log ) ( ) ( )and ( nclassification by design in this sectionwe will present the categories of algorithms based on the design of the various algorithms used in solving problems given problem may have number of solutions when the algorithms of these solutions are analyzedit becomes evident that some implement certain technique or pattern it is these techniques that we will discuss hereand in later sectionin greater detail