Made By Vatsal Agrawal

General-Sorting-Searching-Reversal-Fibonacci-Functions-in-Haskell

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****

1. Run recursiveBinary a b c d for Binary Search
2. Run tailFibo n for fibonacci
3. Run mSort ls for merge Sort
4. Run tailReversal a for reversal of list
5. Run summation f a b c d for HO summation
6. Run recursiveQuick a for quick Sort
7. 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: