Weave Merge Sort is an in-place merge sort variant that interleaves elements from two sorted subarrays by weaving them together, reducing memory usage while maintaining stability.
Paradigm
Divide and Conquer / In-Place Merge
Author
Computer Scientists
Tier
Time Complexity
Best
Avg
Worst
Space
O(1)
Properties