Write a python code function that selects top ten max numbers from a sequence of n integers, test it, and determine the Big-Oh of running time for the algorithm (Do not have to prove)