Every recursive function should have an exit criterion (=handling the base case) to exit the recursion.
Without it, it wil recurse forever, until system resources run out (typically the call stack will overflow and your program will crash).
Btw..which dtadium do u want cricket or football!?
Answer:
Following are the solution to this question:
Explanation:
This algorithm uses the divide and rule approach works, which splits the list into two sublists depending on if they are smaller or larger than the pivotal factor. It has O(n*log n) complexity.
It splits down the list in more than one version frequently till every sublist becomes based on a single element and fuses it to offer an ordered array. The merge type works according. It has O(n*log n) complexity.
Please find the attachment file of the sorting.
You have a specific number of words typed a minute and you need to know the science involved in making it