Sorting an array using Merge Sort
Merge Sort is probably one of the best sorting algorithms. It works by repeatedly dividing an array into smaller parts and combining the results. It keeps dividing the array until the array size
Sorting
Sorting an Array Using Selection Sort
Selection sort is probably the simplest sorting algorithm (for the programmer not the computer). The selection sort algorithm stays true to it's name and works by finding the given array's minimum (or maximum
