Assume N numbers are to be sorted with a recursion algorithm. If we put a bound for the numbers to be sorted and change this bound.

A) Write the algorithm

B) What is complexity? Is it different f no bound is applied?

2) Assume N numbers are to be soited with a recursion algorithm. If we put a bound for the numbers to be sorted and change this bound a) Write this algorithm b) What is the complexity? Is it different if no bound is applied