Sorting algorithm

Implement a sorting algorithm that is O(n log2 n) on average. Do not use the function sort from the STL, or any other function from the STL.

The main program should ask the user for the size of the array, allocate a dynamic array of the appropriate size, and then input all the elements of the array from the cin.

For testing the algorithm you can generate the array using a random number generator.

This is designed so that we can use the Linux redirection to input the array from a file. An example of a test file with 500 numbers to sort is attached.

The output of the program should be the sorted array.

**Timing.** The best timing function I found so far is from a library called MPI. You must include the header file <mpi.h>. The function is MPI_Wtime() with no parameters and returning a double value. If you find another function returning the time more precisely than in seconds, let me know. You must use a compiler called hcp with MPI and include the libraries -lmpi and -llam.

## Deliverables

1) Complete and fully-functional working program(s) in ready to compile (linux) form as well as complete source code of all work done.

2) All deliverables will be considered "work made for hire" under U.S. Copyright law. Buyer will receive exclusive and complete copyrights to all work purchased. (No GPL, GNU, 3rd party components, etc. unless all copyright ramifications are explained AND AGREED TO by the buyer on the site per the coder's Seller Legal Agreement).

## Platform

Linux

Programowanie C Inżynieria Linux MySQL PHP Architektura oprogramowania Testowanie oprogramowania

Numer ID Projektu: #3432149

O projekcie