If an O(n²)sorting algorithm requires 0.2 seconds to sort an array of 1,000 elements,it will require 200 seconds to sort 10,000 elements.

Question

Quizplus · Accepted Answer

The given notation, O(n²), seems to be a typographical error or a misunderstanding. However, if we interpret the question as referring to an algorithm with O(n log n) time complexity (which is common for sorting algorithms), the time to sort 10,000 elements would not scale linearly from the time to sort 1,000 elements. The increase in time would be more than 10 times but significantly less than 200 times due to the logarithmic component of the complexity.

If an O(n2)sorting Algorithm Requires 0

If an O(n²)sorting Algorithm Requires 0