What are some real world examples of nearly sorted lists I found that sorting algorithms such as Insertion Sort and Djikstra's Smoothsort approach O(n) complexity when the list is nearly sorted. What are some real world scenarios where a list is nearly sorted?
What about log files described in AWStats logfile analyzer 7.5 Documentation?


  An error log file is not always completely sorted but only "nearly" sorted because of cache and writing log engines used by a server.