I have a question:
are you interested in the 'native' implementation of an algorithm in the language, that is, in F# using functional constructs and library functions on collections, or are you interested in comparing performance of the same imperative solution (I see your scala implementations are quite imperative)?

If the latter case, you can translate the C# into F# pretty much automatically and achieve very similar performance (hitting the same runtime).

The former case is more interesting, but the results wouldn't necessarily 'line up' with the other contenders', which are implemented from the same base imperative idea.

Hope I made myself clear [8-)]

Clicky: [link:www.luschny.de]

By on 7/1/2010 3:13 AM ()

> are you interested in the 'native' implementation of an algorithm in the language,

> that is, in F# using functional constructs and library functions on collections,

Yes! Exactly this scenario is intended.

> The former case is more interesting,

Absolutely!

> your scala implementations are quite imperative

It is a port from Java. This might change as soon as I learn more

convincing solutions. A more convincing solution for me is the

more efficient one, which can be easily benchmarked. (See my

benchmark page for the high bar.)

If I learn a good functional F# solution maybe I will port it

to Scala? Everything is open, toujours en beta.

Cheers, Peter

By on 7/1/2010 4:01 AM ()

Perhaps I should add that for developing you can use a GUI interface written in C# and available here:

[link:code.msdn.microsoft.com]

Just replace the C# implementations of the benchmark functions by F# implementations. So a convenient testbed is already here.

Cheers, Peter

By on 7/1/2010 5:41 AM ()
IntelliFactory Offices Copyright (c) 2011-2012 IntelliFactory. All rights reserved.
Home | Products | Consulting | Trainings | Blogs | Jobs | Contact Us | Terms of Use | Privacy Policy | Cookie Policy
Built with WebSharper