What is the complexity of above program?

#1

Is the time complexity of recursive merge sort is more than normal merge sort algorithm?

#2

hi @priya_Jain what do you mean by “normal merge sort algorithm” ?

#3

It means without recursion

#4

@priya_Jain please provide the code? I haven’t seen merge sort without recursion so far so i’d like to see the code you are referring to so I can tell the time complexity accordingly.
The time complexity of merge sort is O(nlogn)