427 views
1 votes
1 votes

1 Answer

0 votes
0 votes
The time complexity will of this variation will still remain $\Theta (nlogn)$ as this variation just results in decreasing the time required by Merge Sort for performing Stack Operations for recursions which can take up a lot of time for smaller inputs. Therefore, for smaller inputs an iterative sort is used such as Insertion or Bubble.

Related questions

0 votes
0 votes
0 answers
1
Ujjal Das asked Mar 17
84 views
Calculate the minimum and maximum number of element comparisons involved in 2 way merge sort assuming n is power of 2.
1 votes
1 votes
0 answers
3
0 votes
0 votes
0 answers
4
Nandkishor3939 asked Jan 21, 2019
679 views
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...