Merge Sort, Binary Search, Insertion Sort, Quick Sort, Fibonacci Series ,Reversal of List, High order Summation Function with tail recursive or inductive proof
HOW TO MAKE EXECUTABLE AND RUN PROGRAMME****
- Run recursiveBinary a b c d for Binary Search
- Run tailFibo n for fibonacci
- Run mSort ls for merge Sort
- Run tailReversal a for reversal of list
- Run summation f a b c d for HO summation
- Run recursiveQuick a for quick Sort
- Run tailInsertion a for insertion sort
Problem Statment
Implement tail-recursive reversal of a list. • Implement tail-recursive merge sort. • Implement tail-recursive Fibonacci function. • Implement tail-recursive insertion sort. • Implement recursive quick sort. • Implement recursive binary search given a list, the element and the low and high indices of the list.
Implement a recursive higher-order double summation function to compute: