Sorting Algorithm (modified quicksort)
$30-5000 USD
Paid on delivery
I need a sorting algorithm that is a special case of the "quicksort". The data to be sorted is just an array on ints. Instead of having the pivot at the very left (this is the way my textbook does it, so I assume this is the standard "quicksort"), it should be at the middle of the array, so that after the first pass, all values larger than the pivot are to the right of it, and all values less than the pivot are to the left of it. Then, RECURSIVELY, look at the left list (all values less than pivot) and right lists (all values greater than the pivot) separately, pick a new pivot in each of the lists, and do the same thing: all values less than the new pivot are put to the left of the new pivot and all values greater than the new pivot are to the right of the new pivot. The int arrays are read from a file. ill give you what code Ive written already. File I/O is already written as is subsequent array creation of the values in the file. The array sizes are 3125, 6250, 12500, 25000,and 50000. I'll give you the files containing the int values as well. The algorithm must work for each of these array sizes. The code MUST be ANSI C. I need this done by this coming wednesday dec 11th(thursday dec 12th morning at latest). I will give you the exact file description as a pdf once I accept you to write the code.
## Deliverables
1) Complete and fully-functional working program(s) in executable form as well as complete source code of all work done. 2) Installation package that will install the software (in ready-to-run condition) on the platform(s) specified in this bid request. 3) Complete ownership and distribution copyrights to all work purchased.
## Platform
Must work on GCC compilers and Visual C++ compilers. I wrote what I have so far on a win XP homemachine, and the C compiler I use is visual C++ and/or GCC, but I turn this in on a unix machine, and the code MUST be ANSI C.
Project ID: #2890858
About the project
Awarded to:
