I have been asked the following question..An algorithm considers n elements, sorts 5% of n out, considers the remain elements(95%), sorts 5% of the remain elements, and so on until finally one last element is left. Which complexity does the algorithm have and why?
complexity of an algorithm, sorting 5% out
algorithms;sorting;complexity