c++ programming questions:

The analysis of an algorithm must take into consideration the computer that will be used to run a program that implements the algorithm. The values of the growth-rate function O(log_2 n) grow faster than the values of the growth-rate function O(n). The recursive binary search algorithm is a logarithmic algorithm. Low-order terms in an algorithm's growth-rate function can be ignored. The efficiency of the selection sort depends on the initial arrangement of the data