Analysing 2 recursive calls
Hello, Its difficult for me to analyse recursion flow when 2 recursive calls, Ex: Mergesort(low,mid) MergeSort(mid+1, high) I can analyse mergesort but if i had to write my own program using such recursive call, in what case we use 2 recursive calls as above? I understand call(n-1);call(n-1) in tower of hanoi.. but difficult with mergesort
Outside United States
Thank you for your question for eXtension. The topic area in which you've made a request is not yet fully staffed by eXtension experts and therefore we cannot provide you with a timely answer. We apologize that we can't help you right now, but please come back to eXtension to check in as we grow and add experts.