[Haskell-cafe] Re: Bubble sort algorithm implementations (Haskell vs. C)

kingping yarsanukaev at gmail.com
Mon Mar 22 01:29:08 EDT 2010

Felipe Lessa <felipe.lessa <at> gmail.com> writes:

> On Mon, Mar 22, 2010 at 01:08:39AM +0000, kingping wrote:
> > Here's my C implementation:
> > http://hpaste.org/fastcgi/hpaste.fcgi/view?id=24191#a24191
> I don't know how much difference in time there would be, but you
> should use lists in C and/or mutable arrays in Haskell, otherwise
> you are comparing apples to oranges.  Comparision of algorithms
> should use the same data structures, unless you're asking for a
> comparision of "idiomatic" implementations.

Yes, you're right. However then I'd like to ask what would suit my needs better
Data.Vector, Data.Array or something other.

More information about the Haskell-Cafe mailing list