*** To do this assignment you are not to use any of the Collections API, or any

pre-implemented sort routines in Java. ***

In this assignment you are required to make use of the sorting routines in chapter
8
of you text book. You must ask the user to select which sorting routine he/she
wants to
use out of those routines implemented in the book (Insertion Sort, Shell Sort,
MergeSort,
or QuickSort). Based on the user input, you need to call the corresponding routine.

You are required to write one main program that will read in any number of integers
and store it in an array of ints (not an ArrayList). What you need to do first is
to ask
the user what sorting routine he/she would like to use. Then you need to ask the
user how many integers to be entered as input, and then ask the user to input that
these integers.

Your program will store these integers into an array of integers first. Then your
program is supposed to remove the duplicates out of this array by first sorting the
array (using the user-specified sorting routine), and then removing any duplicates.

Your program must not copy these elements into another array to remove the
duplicates,
the duplicates should be removed in place which means in the same array. Also, you
must
sort the array first before you start duplicate removal.

Once your array (the same array you started with) has only unique numbers, your
program
should print out the array followed by a list of all the numbers that were
duplicated.
The numbers that were duplicated can be stored into another array.

--------
The following would be a sample scenario of running your program:

Make your choice of a sorting routine first. Then continue as follows:

Enter the number of integers: 10

Enter the 10 integers: 7 9 8 1 9 24 23 24 9 8

The resulting array is: 1 7 8 9 23 24

The numbers 8, 9, 24 were duplicated in the input.
--------

The only file that is to be submitted is a Main.java (or Assg6.java) and no other
file.