Find link

language:

Find link is a tool written by Edward Betts.

Longer titles found: Oscillating merge sort (view), Polyphase merge sort (view), Cascade merge sort (view)

searching for Merge sort 9 found (84 total)

alternate case: merge sort

Scratchpad memory (1,545 words) [view diff] exact match in snippet view article find links to article

into smaller chunks) Extending the working set, e.g., a sweet spot for a merge sort where the data fits within 8×256 KB Shared code uploading, like loading

Order-independent transparency (1,108 words) [view diff] exact match in snippet view article find links to article

GPU's memory hierarchy and sorting in registers, similarly to an external merge sort, especially in conjunction with BMA. Approximate OIT techniques relax

External memory algorithm (1,031 words) [view diff] exact match in snippet view article find links to article

similar to quicksort, or via a M B {\displaystyle {\tfrac {M}{B}}} -way merge sort. Both variants achieve the asymptotically optimal runtime of O ( N B log

Richard J. Cole (206 words) [view diff] exact match in snippet view article find links to article

Mathematics Genealogy Project. Cole, Richard (August 1988). "Parallel merge sort" (PDF). SIAM Journal on Computing. 17 (4): 770–785. CiteSeerX 10.1.1.464

In situ (3,883 words) [view diff] exact match in snippet view article find links to article

requires linear space on the call stack (this can be reduced to log space). Merge sort is generally not written as an in situ algorithm. In designing user interfaces

Best, worst and average case (1,273 words) [view diff] exact match in snippet view article find links to article

complexity:Worst Quick sort Array O(n log(n)) O(n log(n)) O(n2) O(n) Merge sort Array O(n log(n)) O(n log(n)) O(n log(n)) O(n) Heap sort Array O(n log(n))

Activity selection problem (1,172 words) [view diff] exact match in snippet view article find links to article

⋅ log ⁡ n ) {\displaystyle O(n\cdot \log n)} time, using for example merge sort, heap sort, or quick sort algorithms. Line 4: Creates a set S {\displaystyle

RCA Spectra 70 (2,507 words) [view diff] no match in snippet view article find links to article

Control, System Maintenance Routines, Report Program Generator, and Sort/Merge." Sort/Merge required a system with 8 KB of memory. The remainder could run

Lustre (file system) (8,797 words) [view diff] exact match in snippet view article

sorted in the local MDT directory hash order, and the client performs a merge sort to interleave the filenames in hash order so that a single 64-bit cookie