Concurrent Quick Sort

Design and implement a concurrent implementation of Quick-Sort in Java. The basic idea is to have each partitioned slice of the array sorted by a separate thread. You should produce an FSP model for the processes and ensure that progress occurs and it does not deadlock. Implement your model in C# or Java. The submission will correctly sort a list of arbitrary length ??" you should provide some test to ensure that the list is correctly sorted. A report should also be submitted ??"discussion of solution, performance, concurrency, design (safety &progress), known problems, difficulties encountered etc. ## 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). 4) A report should also be submitted ??"discussion of solution, performance, concurrency, design (safety &progress), known problems, difficulties encountered etc. ## Platform Programming language can be java or c#