C# Algorithm: ListWeaver
$100-250 USD
Dibayar saat pengiriman
The aim of this competition is to sort a collection of lists respecting their "natural order", as well as the order in which lists are processed. (i.e. elements in the first list take precedence over elements in the second list etc...)
Here are a few examples:
Example1:
List1: Green, Blue, Yellow
List2: Blue, Orange, Red
Result: Green, Blue, Yellow, Orange, Red. (Note that elements in List1 will take precedence on elements in List2.)
For more details please visit: **[url removed, login to view]** and navigate to the ListWeaver Post.
Please read the Welcome page to understand the rules of the competition.
The associated files can be found on the above web page.
## Deliverables
* * *This broadcast message was sent to all bidders on Sunday Jun 10, 2012 7:11:57 AM:
The uploaded files have been updated. One of the secret tests has been added to the unit tests. No one has been able to pass this test yet, so if you have already submitted an entry please review your code, and re-submit. The blog post also has a section on "Method Explanation" which explains hwo the "CanWeave()" method is intended to be used.
* * *This broadcast message was sent to all bidders on Sunday Jun 10, 2012 7:13:32 AM:
The uploaded files have been updated. One of the secret tests has been added to the unit tests. No one has been able to pass this test yet, so if you have already submitted an entry please review your code, and re-submit. The blog post also has a section on "Method Explanation" which explains hwo the "CanWeave()" method is intended to be used.
* * *This broadcast message was sent to all bidders on Sunday Jun 17, 2012 11:08:37 AM:
Hi Everyone, I have updated the competition files with a benchmark project, for you to fine tune your algorithms. (See the download link on the blog page, version 1.3) So far there are about 6 submissions that pass all the unit tests. However no submission is able to pass all the benchmarks yet. (One is very close but gives me a memory overflow on the very last benchmark, and others using recursion give me a stack overflow). Some submissions really struggle with a yarn lengths of 2, so you may have to remove the "2" from the yarn length list to see a result, and then add it back later once you have tuned your implementations. You all are given an extra submission to fine tune your algorithms if you so wish. Cheers, Ben
* * *This broadcast message was sent to all bidders on Sunday Jun 24, 2012 5:27:47 AM:
Thank you to everyone who participated in this competition. I will be going through all the results this week and will announce the winner towards the end of the week.
* * *This broadcast message was sent to all bidders on Tuesday Jun 26, 2012 6:18:36 PM:
The winner has been found and the winning code will be posted on [url removed, login to view] shortly. A new competition will also be published today which is a continuation of the ListWeaver competition and looks at solving the same problem using an adjacency matrix. (So all the unit tests and problem description are the same.) Please follow the blog for updates.
ID Proyek: #2749124