Answer:
The answer is "O(n2)"
Explanation:
The worst case is the method that requires so many steps if possible with compiled code sized n. It means the case is also the feature, that achieves an average amount of steps in n component entry information.
- In the given code, The total of n integers lists is O(n), which is used in finding complexity.
- Therefore, O(n)+O(n-1)+ .... +O(1)=O(n2) will also be a general complexity throughout the search and deletion of n minimum elements from the list.
Answer:
a high level language is any programming language that enables development of a program in a much more user friendly programming context and is generally independent of the computers hardware architecture.