Create three separate sorting algorithms and explain the operations performed in them and best/worse case big-O analysis.

Bubble Sort

Heapsort

Quicksort

Selection Sort

Insertion Sort

Merge Sort

The sort function should be named according to the sort type being used and take an integer array and size as arguments. Each algorithm should take the integer array and sort from largest to smallest.

Each program will need to read input from a file. The file will contain n integers where 0 <= n <= 1000. You can assume each line will contain a valid integer followed by a single character. Your program will read these integers, store them into an array, and then pass the array to your sorting function. After the array has been sorted your program will print out each integer, one per line, to the terminal.

Two sorting algorithms would also be okay if you cannot do three.