Mergesort requires 2N + O(log N) memory as it uses the original input array of N elements and an auxiliary array of also N elements for merging. Other sorting algorithms like insertion sort and selection sort only require N + O(1) memory as they can operate in-place. While mergesort uses more memory than these other algorithms, it has better time complexity of O(N log N).
Mergesort requires 2N + O(log N) memory as it uses the original input array of N elements and an auxiliary array of also N elements for merging. Other sorting algorithms like insertion sort and selection sort only require N + O(1) memory as they can operate in-place. While mergesort uses more memory than these other algorithms, it has better time complexity of O(N log N).
Mergesort requires 2N + O(log N) memory as it uses the original input array of N elements and an auxiliary array of also N elements for merging. Other sorting algorithms like insertion sort and selection sort only require N + O(1) memory as they can operate in-place. While mergesort uses more memory than these other algorithms, it has better time complexity of O(N log N).
Mergesort requires 2N + O(log N) memory as it uses the original input array of N elements and an auxiliary array of also N elements for merging. Other sorting algorithms like insertion sort and selection sort only require N + O(1) memory as they can operate in-place. While mergesort uses more memory than these other algorithms, it has better time complexity of O(N log N).
Copyright:
Attribution Non-Commercial (BY-NC)
Available Formats
Download as PDF, TXT or read online from Scribd
Download as pdf or txt
You are on page 1/ 1
What is a merge sort? Sorting algorithms improve Time & Space! Mergesort analysis: Memory Q.
How much memory does mergesort require? A. Too much!
Original input array = N. Auxiliary array for merging = N. Local variables: constant. Function call stack: log N [stay tuned]. Total = 2N + O(log N). 2
Q. How much memory do other sorting algorithms require?
N + O(1) for insertion sort and selection sort. In-place = N + O(log N). Challenge for the bored. In-place merge. [Kronrud, 1969]
