Program 3.2

/*******************************************************

Program Number: A3_2

Purpose/Description: <Sort a sequence of N numbers>

Author: <Nicolas Dabdoub>

Due date: <03/30/15>

Certification:

I hereby certify that this work is my own and none of it is the work of any other 

person.

 < Nicolas Dabdoub >

*******************************************************/

MergeSort each subsequence and once that will come out to O(k(log k)) worst-case
then since there are N/K subsequences there will be O((N/K)*k(log k)) therefore
the complexity will be O(K (log K)).