Iterative Merge Sort sorts an array using a bottom-up approach, merging subarrays iteratively rather than using recursion.
Paradigm
Divide and Conquer / Bottom-Up
Author
Computer Scientists
Tier
Time Complexity
Best
Avg
Worst
Space
O(n)
Properties