(a) The best algorithms for sorting a set of n numbers have a complexity that is O (n) log n . Add a row to Table 3.1 corresponding to such an algorithm. (b) Is such an algorithm a polynomial or...

(a) The best algorithms for sorting a set of n numbers have a complexity that is O (n) log n . Add a row to Table 3.1 corresponding to such an algorithm.

(b) Is such an algorithm a polynomial or nonpolynomial time algorithm?

(a) A total enumeration algorithm for the traveling salesman problem would be an O (n!) algorithm. Add a row to Table 3.1 corresponding to such an algorithm. (b) Is such an algorithm a polynomial or nonpolynomial time algorithm?