Register

merge sort

618 views
0 0 votes
what is the time complexity of merge sort for already sorted array explain with example?

Please log in or register to answer this question.

Voting & Accepting an answer helps improve the community
← Previous · Sheldon ross 5JNext → · SELF DOUBT TIFR QUES...
← Previous in category · time complexity of r...Next in category → · merge sort
Position:
Show:

Related questions

1 1 vote
1 1 answer
175
175 views
GO Classes asked Aug 10
175 views
GO Classes DPP | GATE CS, DA | Algorithms | Merge Sort
Mergesort recursively sorts the two halves of an array.After both recursive calls have finished, but before the merge operation, which statement must be true?The complete...
3 3 votes
1 1 answer
274
274 views
GO Classes asked Aug 4
274 views
GO Classes DPP | GATE CS, DA | Algorithms | Merge Sort
Assume that a merge sort algorithm in the worst case takes $30$ seconds for an input of size $64$. Which of the following most closely approximates the maximum input size...
2 2 votes
1 1 answer
190
190 views
GO Classes asked Aug 4
190 views
GO Classes DPP | GATE CS, DA | Algorithms | Four-Way Merge Sort
Suppose instead of dividing the input into two parts, a modified merge sort divides the input into four equal parts, sorts each one-fourth recursively, and finally combin...
3 3 votes
1 1 answer
210
210 views
GO Classes asked Aug 4
210 views
GO Classes DPP | GATE CS, DA | Algorithms | Merge Sort
Merge sort divides an array of size $n$ into two halves, recursively sorts both halves, and then merges the two sorted halves.Which recurrence correctly represents merge ...