From: Andy
Subject: Learn search algorithm with lisp
Date: 
Message-ID: <1183014581.537026.113100@e16g2000pri.googlegroups.com>
I want to learn some search algorithms such as BFS, DFS, A* and so
on.

I am very familiar with C++. And I can write the search programs in C+
+ without any difficulty.

But I have heard that Lisp is more convenient for search algorithms.
So I want to learn Lisp. I don't know whether this is a good idear or
not. Because it seems that Common Lisp has neither datastructures such
as  queue, priority_queue, map  nor algorithms such as partial_sort,
make_heap.

Can anyone give me some advice?
From: Tamas Papp
Subject: Re: Learn search algorithm with lisp
Date: 
Message-ID: <87wsxojyix.fsf@pu100877.student.princeton.edu>
Andy <·······@gmail.com> writes:

> I want to learn some search algorithms such as BFS, DFS, A* and so
> on.
>
> I am very familiar with C++. And I can write the search programs in C+
> + without any difficulty.
>
> But I have heard that Lisp is more convenient for search algorithms.
> So I want to learn Lisp. I don't know whether this is a good idear or
> not. Because it seems that Common Lisp has neither datastructures such
> as  queue, priority_queue, map  nor algorithms such as partial_sort,
> make_heap.
>
> Can anyone give me some advice?

Most of the stuff you want is already in CL or can be implemented
easily.  I suggest that you read an introductory book on Common Lisp,
Peter Seibel's Practical Common Lisp (available as a book or online)
and Paul Graham's ANSI Common Lisp were useful for me.  If I remember
correctly, Graham's book contains examples of various kinds of queues.

Best,

Tamas
From: Pascal Bourguignon
Subject: Re: Learn search algorithm with lisp
Date: 
Message-ID: <87bqf0wirr.fsf@informatimago.com>
Andy <·······@gmail.com> writes:

> I want to learn some search algorithms such as BFS, DFS, A* and so
> on.
>
> I am very familiar with C++. And I can write the search programs in C+
> + without any difficulty.
>
> But I have heard that Lisp is more convenient for search algorithms.
> So I want to learn Lisp. I don't know whether this is a good idear or
> not. Because it seems that Common Lisp has neither datastructures such
> as  queue, priority_queue, map  nor algorithms such as partial_sort,
> make_heap.

Well, lisp has the euclidian division algorithm.  Is it not enough?

C/USER[118]> (truncate 7 3)
2 ;
1


> Can anyone give me some advice?

Start with http://www.cliki.net/
http://www.cliki.net/Education
http://www.cliki.net/Online+Tutorials

http://www.cliki.net/Lisp%20books
http://www.lispworks.com/documentation/HyperSpec/Front/index.htm



-- 
__Pascal Bourguignon__                     http://www.informatimago.com/

NOTE: The most fundamental particles in this product are held
together by a "gluing" force about which little is currently known
and whose adhesive power can therefore not be permanently
guaranteed.
comp.lang.lisp / 2007 / jun