Different Sorting Algorithms and their efficiencies are implemented
- Insertion Sort works efficiently for smaller arrays.
- Merge sort works efficiently on larger arrays but considerably poor on smaller chunks.
- Quick sort works really well on arrays with larger length.
- Tim sort is a combination of Insertion and merge and is used as a built in sort method in Java.
