Write a program that implements the following search algorithms:

• Selection Sort
• Bubble Sort
• Merge Sort
• Quick Sort

Create an array of randomly selected whole numbers of 1,000 elements

1. Each value is selected from the range 0-999

1. Sort that array using each method

2. Make sure to copy the initial array into a new one so that the tests will be accurate and not be sorting sorted arrays
3. Do not create new arrays for each algorithms as they serve as the control
4. Show that each method successfully sorted the array
5. Count the number of checks each method had to perform before fully sorting the array
   1. HINT: The inner most loop or inner most recursion is where the count should be performed.
6. Keep track of the total number of checks for each algorithm