| Webster's Online Dictionary |
| Expressions | Domain | Definition | |
| Ideal merge | Math | Merge n sorted streams into one output stream. To begin the streams are sorted by the value of the head element of each. Then the head of the first stream, which is the least since the streams were sorted, is removed and written to the output. That stream is inserted back into the list of streams according to its new head. Taking the head of the first stream and reinserting that stream is repeated until all elements have been processed. Using binary search to find the new place to insert a stream, the execution time is (M log N) where M is the total number of elements. (references) | |
Source: compiled by the editor from various references; see credits. | Top | ||
