C# or F# Algorithm: Faster than QuickSort?

Concluído Postado Aug 10, 2012 Pago na entrega
Concluído Pago na entrega

The purpose of this competition is to extract the start and end times from a list of DateRanges (which has already been pre-sorted) as a sorted DateTime list.

A DateRange can be thought of as a period of time that has well defined start and end time. (Please have a look at the class [url removed, login to view] to get a better understanding of how this class works.)

The DateRange class implements the IComparable Interface, such that the DateRanges with earliest start times come first.

If two DateRanges have the same start time, then the DateRange with the shortest duration comes first.

For more information please visit the [competition page.][1]

## Deliverables

* * *This broadcast message was sent to all bidders on Wednesday Aug 29, 2012 7:50:15 PM:

Hi Everyone, Sorry for getting back to you late, I have been too busy ... The tentative final results for the competition are now on the blog. Please have a look at the Google groups post [url removed, login to view]!topic/orcomps/A5Nmju8o2H0 to download the files and double check that your code is indeed the last submission. Cheers, Ben

Programação C# Engenharia PHP Arquitetura de software Teste de Software

ID do Projeto: #2767062

Sobre o projeto

4 propostas Projeto remoto Ativo em Aug 10, 2012

Concedido a:

ZaherS

See private message.

$90 USD em 14 dias
(16 Comentários)
4.5

4 freelancers estão ofertando em média $23 nesse trabalho

eried

See private message.

$0 USD in 14 dias
(78 Comentários)
5.5
MoustafaS

See private message.

$0 USD in 14 dias
(12 Comentários)
3.5
oorabi

See private message.

$0 USD in 14 dias
(0 Comentários)
0.0