(DUE IN 20 HOURS) Create a mergesort and selection sort without direction comparison, using custom function.
- Status Completed
- Budget $10 - $30 USD
- Total Bids 12
I need to implement merge sort and selection sort, however I cannot use direction comparisons. Rather I need to use a special method called, 8min and 8sort. Given an array of 8 elements, 8 min returns the index of the smallest element, and 8sort returns an array of the indices which contain the location of the index in increasing order. I need to create a selection sort that uses each of the two methods. Then using 8 sort, create merge sort.Get free quotes for a project like this
Looking to make some money?
- Set your budget and the timeframe
- Outline your proposal
- Get paid for your work
Hire Freelancers who also bid on this project
Looking for work?
Work on projects like this and make money from home!Sign Up Now
- The New York Times
- Wall Street Journal
- Times Online