C# or F# Algorithm: Faster than QuickSort?

Completado Publicado Aug 10, 2012 Pagado a la entrega
Completado Pagado a la 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

Programación en C# Ingeniería PHP Arquitectura de software Verificación de software

Nº del proyecto: #2767062

Sobre el proyecto

4 propuestas Proyecto remoto Activo Aug 10, 2012

Adjudicado a:

ZaherS

See private message.

$90 USD en 14 días
(16 comentarios)
4.5

4 freelancers están ofertando un promedio de $23 por este trabajo

eried

See private message.

$0 USD en 14 días
(78 comentarios)
5.5
MoustafaS

See private message.

$0 USD en 14 días
(12 comentarios)
3.5
oorabi

See private message.

$0 USD en 14 días
(0 comentarios)
0.0