سوال ۲۰ کنکور ارشد ریاضی ۱۴۰۰

Read the passage and answer the question.

Passage (final paragraph): "The ideal iterative method in linear algebra reduces the number of steps from m to O(1) and the work per step from O(m^2) to O(m), reducing the total work from O(m^3) to O(m). Such extraordinary speedups do occur in practical problems, but a more typical improvement is perhaps from O(m^3) to O(m^2). In a practical large-scale engineering computation of the mid-1990s, where iterative algorithms are successful, perhaps a typical result is that they beat direct algorithms by a factor on the order of 10. As machines get faster and m gets larger in the future, this factor will increase and iterative algorithms will become more important, illustrating the fundamental law of computer science: the faster the computer, the greater the importance of speed of algorithms."

Question: As computers grow to be faster, ------------.