tag

#online

7 pages tagged

Wiki › Algorithms › 01. Searching and Sorting ›

9. Partial, Online, and Adaptive Sorting

9. Partial, online, and adaptive sorting, 30 index slug name 256 partial-sort Partial Sort 257 top-k-sort Top K Sort 258 incremental-sort Incremental Sort 259 online-insertion-sort Online Insertion Sort 260 adaptive-merge-sort Adaptive Merge Sort 261 natural-runs-sort Natural Runs Sort 262 patience-sorting-lis Patience Sorting for LIS 263 replacement-selection Replacement Selection 264 nearly-sorted-insertion-sort Nearly Sorted Insertion Sort 265 k-sorted-array-sort K Sorted Array Sort 266 min-heap-k-sorted-sort Min Heap K Sorted Sort 267 timsort-run-detection Timsort...
algorithms sorting adaptive online May 6, 2026
Wiki › Algorithms › 01. Searching and Sorting › 9. Partial, Online, and Adaptive Sorting ›

Binary Tree Online Sort

Binary Tree Online Sort Binary tree online sort inserts elements into a binary search tree (BST) as they arrive, then produces sorted output via in-order traversal. You use it when data arrives incrementally and you want ordered queries or final sorted output without a separate sorting phase. Problem Given a stream ( x_1, x_2, \dots, x_n ), maintain a structure such that: insertion is performed online elements can be retrieved...
algorithms sorting binary-search-tree online tree-sort
Wiki › Algorithms › 01. Searching and Sorting › 9. Partial, Online, and Adaptive Sorting ›

Order Maintenance Sort

Order Maintenance Sort Order maintenance sort maintains a total order of elements under dynamic insertions. Instead of re-sorting, it assigns labels that preserve relative order and supports fast comparisons. You use it when elements are inserted over time and you need to maintain their sorted or logical order efficiently. Problem Maintain a sequence that supports: inserting an element after another element comparing the order of two elements preserving total order...
algorithms sorting order-maintenance online data-structures
Wiki › Algorithms › 01. Searching and Sorting › 9. Partial, Online, and Adaptive Sorting ›

Online Topological Sort

Online Topological Sort Online topological sort maintains an ordering of a directed acyclic graph while updates arrive over time. Unlike ordinary topological sort, the graph is not fixed before the algorithm starts. You use it when dependencies are discovered incrementally, such as build systems, schedulers, package managers, and dynamic workflow engines. Problem Given a directed graph ( G = (V, E) ), maintain an ordering ( \pi ) such that...
algorithms sorting topological-sort online graphs
Wiki › Algorithms › 01. Searching and Sorting › 9. Partial, Online, and Adaptive Sorting ›

Sliding Window Sort

Sliding Window Sort Sliding window sort maintains the elements inside a fixed-size moving window in sorted order. As each new element arrives, the oldest element leaves and the new element enters. You use it when sorted queries are needed over recent data, not over the full stream. Problem Given a stream ( x_1, x_2, \dots ) and a window size ( w ), maintain a sorted view of the active...
algorithms sorting streaming sliding-window online
Wiki › Algorithms › 01. Searching and Sorting › 9. Partial, Online, and Adaptive Sorting ›

Online Insertion Sort

Online Insertion Sort Online insertion sort is insertion sort used in an online setting. It accepts elements one at a time and keeps all seen elements sorted after each insertion. You use it when the input is not available all at once, but the sorted prefix must remain queryable during processing. Problem Given a stream of values ( x_1, x_2, \dots, x_n ), maintain a sorted sequence ( S )...
algorithms sorting online insertion-sort
Wiki › Algorithms › 01. Searching and Sorting › 9. Partial, Online, and Adaptive Sorting ›

Incremental Sort

Incremental Sort Incremental sort maintains a sorted structure as new elements arrive. Instead of sorting after all data is available, it updates order step by step. You use it when data arrives over time or when intermediate sorted states are required. Problem Given a stream or sequence ( A ), process elements one by one and maintain a structure such that: elements seen so far remain sorted insertion preserves order...
algorithms sorting incremental online