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

2010-03-21 Thread kingping
Felipe Lessa gmail.com> writes: > > On Mon, Mar 22, 2010 at 01:08:39AM +, 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 mutabl

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

2010-03-21 Thread Felipe Lessa
On Mon, Mar 22, 2010 at 01:08:39AM +, 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

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

2010-03-21 Thread kingping
Felipe Lessa gmail.com> writes: > > On Sun, Mar 21, 2010 at 03:39:08PM +1000, Yasir Arsanukaev wrote: > > I'm interested not in particular algorithm performance but rather in > > performance of its implementations in various languages. > > Is your C program using lists or arrays? These are dif