tag

#lazy

2 pages tagged

Wiki › Algorithms › 01. Searching and Sorting › 9. Partial, Online, and Adaptive Sorting ›

Lazy Sort

Lazy Sort Lazy sort delays sorting until the program needs ordered output. Instead of immediately sorting every inserted element, it stores unsorted data and performs sorting only when a query requires order. You use it when many updates happen before few sorted reads. Problem Maintain a collection that supports: inserting elements requesting sorted output avoiding unnecessary sorting work when sorted output is never requested Idea Keep inserted elements in an...
algorithms sorting lazy deferred adaptive
Wiki › Algorithms › 01. Searching and Sorting › 9. Partial, Online, and Adaptive Sorting ›

Lazy Selection Sort

Lazy Selection Sort Lazy selection sort produces sorted output incrementally. Instead of sorting the entire array, it finds the next smallest element only when requested. You use it when you need a few smallest elements or when output is consumed step by step. Problem Given an array ( A ), support an operation: next() that returns the next smallest element without sorting the entire array in advance. Idea Keep track...
algorithms sorting selection lazy partial-sort