Data Structures and Abstraction

This project involves altering the implementation of Project 2(attached) so that: * after the data from the input file is filled in the array, the array is sorted using the QuickSort algorithm *then the sorted array is written into an output file *the input and output file names are supplied as arguments to the program on the command line *the sort function is a template function that can be used to sort arrays of any length, containing any type of data. *Assume that the names in the input file are not sorted. ## Deliverables 1) Complete and fully-functional working program(s) in executable form as well as complete source code of all work done. 2) Deliverables must be in ready-to-run condition, as follows (depending on the nature of the deliverables): a) For web sites or other server-side deliverables intended to only ever exist in one place in the Buyer's environment--Deliverables must be installed by the Seller in ready-to-run condition in the Buyer's environment. b) For all others including desktop software or software the buyer intends to distribute: A software installation package that will install the software in ready-to-run condition on the platform(s) specified in this bid request. 3) 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 Windows XP