Python

Is each of the following True or False When run on the same inputs, an exponential algorithm will always take longer than a polynomial algorithm. Newton's method is based upon successive approximation. For large size n O(n log n) means the same as O(n^2) Pseudo code is a name of a computer language Brute force method can never have exponential complexity