C++ or Java. Please post OUTPUT of code

The purpose of the programming assignment is to perform empirical analysis of the following sorting algorithms on integer arrays:

a. selection sort;

b. insertion sort;

c.two versions of a bubble sort: with and without counting the number of swaps on each pass through an array;

d. quicksort;

e. mergesort.

Requirements:

functions from standard libraries implementing sorting algorithms are NOT allowed

run your functions for the following types of arrays containing 100, 1000 and 10000 integers: random numbers, sorted list, almost sorted list (say, each 10^th number is out of order);

the size of integers is supposed to be from 1 to 10000;

you may store your (non-random) arrays in the FILES