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

On Mon, 19 May 2008 12:00:38 -0700 (PDT), Christina
<christine.uk2000@xxxxxxxxx> 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 and Java runs in 2 or 3
miliseconds....for small input, still Java is better in comparison
with Trinc-Prolog. I will also test minimax algorithm for checkers,
both in Java and in Prolog, but this will take some time....firstly, I
am interested in small problems that would prove Prolog's efficiency
over Java.

Why you care about speed?...

I want to know which problems work better in Prolog than in Java, so
that I can continue my study.

An attempt to program application based on CLP(FD) constraint solver
in C++/Java ended without success after over a year and tons of monies
spent. It was estimated that project will never complete within
scheduled time and within the budget. Implementing the same solver in
Prolog was almost trivially simple.

Your complain than bubble sort in Prolog is not fast enough is about
the same as complaint that electric drill is not a good hammer. It is
not, similarly as Prolog is not for bubble sort. And is not for many
other things.

A.L.
.

Relevant Pages