An algorithm It made up of 3 parts that execute consecutivel

An algorithm It made up of 3 parts that execute consecutively. The first part is a loop that is O(3n+ 5), the second part is a sort that is O(n logn + n). and the third part is a search that is O(n^2). What is the order of the algorithm as a whole? Why? An algorithm is analyzed and found to take time as a function of n. T(n) = 2n^2 + 5n What is the order of the algorithm? Find a c_0 and n_0 to prove your answer

Solution

Given there are 3 parts.

First part efficiency is: O(3n + 5).

Second part efficiency is: O(nlogn + n)

Third part efficiency is: O(n²).

When you have multiple parts with different efficiencies in the algorithm, please note that, the overall efficiency of the algorithm is: the one part which takes the maximum amount of time, i.e., the one part with least efficiecny.

As per your specification, the least efficient part is the third part. And it therefore, the order of the algorithm as a whole is: O(n²).