0 votes 0 votes What is the extra memory needed for merge sort: 1] In case of Iterative merge sort.(DS:Array) 2]In case of Recursive merge sort.(DS:Array) 3] In case of Iterative merge sort.(DS:Linked List) 4]In case of Recursive merge sort.(DS:Linked List) Algorithms merge-sort algorithms sorting + – Nandkishor3939 asked Jan 21, 2019 Nandkishor3939 698 views answer comment Share Follow See all 2 Comments See all 2 2 Comments reply noob_coder commented Apr 30, 2019 reply Follow Share Case :1 Only extra array of size n will be needed. Case 2: Extra array + Stack space Case 3: I think we will not need any extra space for rersult as we can just change the links. Case 4. only stack space will be extra. 3 votes 3 votes reboot commented Jan 4, 2021 reply Follow Share I think, even in array variant of iterative merge sort we can perform in-place sorting. Hence, O(1) for case 1 too. 0 votes 0 votes Please log in or register to add a comment.
