DSA Lab 4 - Recursion & Sorting Algorithems

Task 1:

Implement the following algorithms recursively:

• sumOfArray()      // This function will take an integer array as input and output its sum.
• computeFactorial()    //This function will take an integer as input and output its factorial
• displayFibonacciSeries()    //This function will take an integer as input and output that many terms of fibonacci series. e.g input = 6 then output = 1 1 2 3 5 8

Task 2:

Implement the following sorting algorithms recursively:

• mergeSort()
• quickSort()

Note: we have implemented these sorting algorithms before in lab 2. This time we have to implement them recursively.