In considering a sorting problem, how important is it to you that some of the data is likely to be ordered?

It depends on the size of the data structure and the algorithm used, if the data structure is small, then an ordered data is not relevant considering the choice of speed.

Explanation:

There are various data structures and algorithms. The time taken to iterate through a small unordered list or array data is relevant (a linear sort of O(n) would not be harmful), but as the size increases, the execution time increases.

So, for larger data structures, an ordered data and a more time-efficient algorithm is adopted.

answer; peter zenger;