Rotate Merge Sort is an in-place merge algorithm that rotates elements to merge two consecutive sorted subarrays efficiently without additional memory.
Paradigm
Divide and Conquer / In-Place Merge
Author
Computer Scientists
Tier
Time Complexity
Best
Avg
Worst
Space
O(1)
Properties