Login Form






Lost Password?
No account yet? Register
Freelancer Jobs arrow Freelancer Jobs - Archive 2007
JobId: #1372384

Efficient Manual List Sorting

Categories: Web,Flash,Requirements,Misc (software related),Web Services,Other (Database),Other (Web),Data Entry,Software Related (Includes Websites),Other (Virtual Assistant)
Posted By: suitzoot  (0 ratings)
Source: Rent-a-coder
Job viewed: 622 times
Bids Placed: 8
Start Date: 2010-03-22 05:11:11
End Date: 2010-04-10 17:00:52
Time Remaining:
Deadline: Please estimate in your bid
Current Phase: Bidding open
Max Accepted Bid: Open to fair suggestions
Project Type: Small Business Project: $100(USD) and above
Bid Type: Open Auction
Brief Summary:

We want an element of a larger project - the simplest description would be a deductive sorting method that allows a user to sort a list with the least comparisons / clicks possible.
<span style="font-size: medium; ">The UI is this: They have a list of unsorted items. They are presented with two items at a time and prompted to click on the most 'important'. We would like to have the code that uses relationship memory between the items to make assumptions about the order and can sort the list with the least number of </span>steps required from the user. Exchanging cpu cycles for brain cycles :)
We were inspired by those old logic puzzles in the newspaper: "John is taller than sally, but shorter than bob. Sort them in order."

If it's already been open-sourced and it's lying around somewhere, that's cool we'll still pay you for tracking it down for us.

About me: Not a time-waster. I've been working with my friend who's a kick-ass coder, but he's too busy at his 9-5 to spend much time on my online apps projects. Looking for a meticulous and intelligent coder who can help build elements with us - adequate notation, etc would be nice too so we can pick up easily in the future. I'm happy to pay well for quality, efficient code. Bid high if you can deliver the best. 
We're going to take it step by step so if we're happy with each step we'll keep coming back for your services.