1

2.

Rank the following computational cost growth rates from least expensive to most expensive: O(n log n), O(2^n), O(10^n), O(log n), O(n^3), O(1), O(n^2), and O(n).

Order least expensive to most expensive :

Answer these two question with ideas and steps plz

Suppose you have a function d(x1,22) that takes in two entities i and and outputs a comparison or distance between the two entities. Suppose you have a set of n entities. If computing d takes constant time, what is the computational complexity in running time of computing the distances for all pairs of entities? 0( 2) O O(n log n) 0(2") O(n)