Re: In which cases/problems is Prolog faster than Java?

On Mon, 19 May 2008 13:00:38 -0700, Christina wrote:

I have implemented sorting algorithms like merge sort, tree sort and
bubble sort in both Java and Trinc-Prolog, hoping to prove that Prolog
runs faster than Java....Unfortunately, for large amount of data
(30000 input size), Trinc-Prolog dies

Either your version of mergesort is crappy, or Trinc-Prolog stinks :-)
Probably both.
Show us your mergesort please. A reasonable mergesort in SWI-Prolog
(not the fastest around) sorts 30000 elements easily.

Cheers

Bart
.