1- A certain algorithm takes twice as long to process 1000n elements as it does to process n elements. Give a possible time complexity for this algorithm and a specific value of n
2- A certain O(nlogn) algorithm is always used in practice over an available O((logn)^2) algorithm
1 - is it on^2
2 - ?