http://ilyasterin.com/blog/2009/11/merge-sort-implementation-and-performance-in-scala-and-ruby.html Against the grain software and startups Thu, 26 Jan 2012 12:50:49 +0000 hourly 1 http://wordpress.org/?v=3.3.1 http://ilyasterin.com/blog/2009/11/merge-sort-implementation-and-performance-in-scala-and-ruby.html#comment-86 Ittay Sun, 27 Dec 2009 01:24:59 +0000 http://ilya.cobrio.com/blog/2009/11/merge-sort-implementation-and-performance-in-scala-and-ruby.html#comment-86 <p>You're comparing an implementation with a linked list to one with an array. Why not use Array for the Scala implementation? Also, you're not giving JIT a chance. Both because of running one sort and because your code runs inside the Application constructor which is not JIT. Try using a regular main and running one sort, then timing another one.</p> You’re comparing an implementation with a linked list to one with an array. Why not use Array for the Scala implementation? Also, you’re not giving JIT a chance. Both because of running one sort and because your code runs inside the Application constructor which is not JIT. Try using a regular main and running one sort, then timing another one.

]]> http://ilyasterin.com/blog/2009/11/merge-sort-implementation-and-performance-in-scala-and-ruby.html#comment-193 Ittay Sun, 27 Dec 2009 01:24:00 +0000 http://ilya.cobrio.com/blog/2009/11/merge-sort-implementation-and-performance-in-scala-and-ruby.html#comment-193 <p>You're comparing an implementation with a linked list to one with an array. Why not use Array for the Scala implementation? Also, you're not giving JIT a chance. Both because of running one sort and because your code runs inside the Application constructor which is not JIT. Try using a regular main and running one sort, then timing another one.</p> You’re comparing an implementation with a linked list to one with an array. Why not use Array for the Scala implementation? Also, you’re not giving JIT a chance. Both because of running one sort and because your code runs inside the Application constructor which is not JIT. Try using a regular main and running one sort, then timing another one.

]]> http://ilyasterin.com/blog/2009/11/merge-sort-implementation-and-performance-in-scala-and-ruby.html#comment-85 Ilya Sterin Thu, 26 Nov 2009 22:56:05 +0000 http://ilya.cobrio.com/blog/2009/11/merge-sort-implementation-and-performance-in-scala-and-ruby.html#comment-85 <p>Maxim, thanks. I published an update. This change was the answer. Ilya</p> Maxim, thanks. I published an update. This change was the answer. Ilya

]]> http://ilyasterin.com/blog/2009/11/merge-sort-implementation-and-performance-in-scala-and-ruby.html#comment-192 Ilya Sterin Thu, 26 Nov 2009 22:56:00 +0000 http://ilya.cobrio.com/blog/2009/11/merge-sort-implementation-and-performance-in-scala-and-ruby.html#comment-192 <p>Maxim, thanks. I published an update. This change was the answer. Ilya</p> Maxim, thanks. I published an update. This change was the answer. Ilya

]]> http://ilyasterin.com/blog/2009/11/merge-sort-implementation-and-performance-in-scala-and-ruby.html#comment-84 r4i Thu, 26 Nov 2009 05:39:52 +0000 http://ilya.cobrio.com/blog/2009/11/merge-sort-implementation-and-performance-in-scala-and-ruby.html#comment-84 <p>I’ve run the Ruby benchmark using the different Ruby interpreters, and I wrapped the loop for benchmark like this: require ‘benchmark’ puts Benchmark.measure{ 3000.times do mergesort(numbers) end } Here’s the promising future of Ruby: $ ruby merge_sort.rb 7.520000 0.520000 8.040000 ( 8.307699) $ ruby1.9 merge_sort.rb 2.830000 0.030000 2.860000 ( 2.951124) $ jruby -J-server merge_sort.rb 4.882000 0.000000 4.882000 ( 4.746000) Cheers.</p> I’ve run the Ruby benchmark using the different Ruby interpreters, and I wrapped the loop for benchmark like this: require ‘benchmark’ puts Benchmark.measure{ 3000.times do mergesort(numbers) end } Here’s the promising future of Ruby: $ ruby merge_sort.rb 7.520000 0.520000 8.040000 ( 8.307699) $ ruby1.9 merge_sort.rb 2.830000 0.030000 2.860000 ( 2.951124) $ jruby -J-server merge_sort.rb 4.882000 0.000000 4.882000 ( 4.746000) Cheers.

]]> http://ilyasterin.com/blog/2009/11/merge-sort-implementation-and-performance-in-scala-and-ruby.html#comment-191 r4i Thu, 26 Nov 2009 05:39:00 +0000 http://ilya.cobrio.com/blog/2009/11/merge-sort-implementation-and-performance-in-scala-and-ruby.html#comment-191 <p>I’ve run the Ruby benchmark using the different Ruby interpreters, and I wrapped the loop for benchmark like this: require ‘benchmark’ puts Benchmark.measure{ 3000.times do mergesort(numbers) end } Here’s the promising future of Ruby: $ ruby merge_sort.rb 7.520000 0.520000 8.040000 ( 8.307699) $ ruby1.9 merge_sort.rb 2.830000 0.030000 2.860000 ( 2.951124) $ jruby -J-server merge_sort.rb 4.882000 0.000000 4.882000 ( 4.746000) Cheers.</p> I’ve run the Ruby benchmark using the different Ruby interpreters, and I wrapped the loop for benchmark like this: require ‘benchmark’ puts Benchmark.measure{ 3000.times do mergesort(numbers) end } Here’s the promising future of Ruby: $ ruby merge_sort.rb 7.520000 0.520000 8.040000 ( 8.307699) $ ruby1.9 merge_sort.rb 2.830000 0.030000 2.860000 ( 2.951124) $ jruby -J-server merge_sort.rb 4.882000 0.000000 4.882000 ( 4.746000) Cheers.

]]> http://ilyasterin.com/blog/2009/11/merge-sort-implementation-and-performance-in-scala-and-ruby.html#comment-83 Maxim Thu, 26 Nov 2009 04:57:04 +0000 http://ilya.cobrio.com/blog/2009/11/merge-sort-implementation-and-performance-in-scala-and-ruby.html#comment-83 <p>Try to replace the line #28 while(left.length > 0 && right.length > 0) { with the following while(left.lengthCompare(0) > 0 && right.lengthCompare(0) > 0) { Best regards,</p> Try to replace the line #28 while(left.length > 0 && right.length > 0) { with the following while(left.lengthCompare(0) > 0 && right.lengthCompare(0) > 0) { Best regards,

]]> http://ilyasterin.com/blog/2009/11/merge-sort-implementation-and-performance-in-scala-and-ruby.html#comment-190 Maxim Thu, 26 Nov 2009 04:57:00 +0000 http://ilya.cobrio.com/blog/2009/11/merge-sort-implementation-and-performance-in-scala-and-ruby.html#comment-190 <p>Try to replace the line #28 while(left.length > 0 && right.length > 0) { with the following while(left.lengthCompare(0) > 0 && right.lengthCompare(0) > 0) { Best regards,</p> Try to replace the line #28 while(left.length > 0 && right.length > 0) { with the following while(left.lengthCompare(0) > 0 && right.lengthCompare(0) > 0) { Best regards,

]]>