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.
Natural gas.
-----------------
The flowchart to reverse digits of an integer may be explained like this: <span>If its a decimal number you could use modulus function to return the first lowest digit in the integer like 45%10 would give you a 5. By doing that you will have the number reversed. Lets see an example of that
Flow: (Lets take for example 123)
num = 123
loop
print num%10 (prints 3)
num = num/10 (num now is 12 - integer division removes remainder)
end loop
result : 321</span>
