1 votes 1 votes Algorithms sorting algorithms normal + – radha gogia asked Dec 8, 2015 • retagged Jun 21, 2022 by makhdoom ghaya radha gogia 631 views answer comment Share Follow See all 3 Comments See all 3 3 Comments reply Pooja Palod commented Dec 9, 2015 reply Follow Share in merge sort there will be will be more no of recursive calls 0 votes 0 votes radha gogia commented Dec 9, 2015 reply Follow Share but in merge-sort also we have 2 calls for merge-sort and 1 for merge procedure and in quick-sort also we have 2 recursive calls for quick-sort and 1 for partition so how come merge-sort will have more no of recursive calls ? 0 votes 0 votes Prasanna commented Dec 9, 2015 reply Follow Share For merge sort, you need to do some "merging," which needs extra array(s) to store the data before merging; but in quick sort, you don't. That's why quick sort is in-place. There are also some extra comparisons made for merging which increase constant factors in merge sort. 2 votes 2 votes Please log in or register to add a comment.
0 votes 0 votes For smaller inputs quick sort perform better than the merge sort, due to the fact the merge sort is not in place unlike quick sort. We need more amount of space in case of merge sort. monanshi answered Dec 10, 2015 monanshi comment Share Follow See all 0 reply Please log in or register to add a comment.
