On Wed, 23 Apr 2008, Aykut Caglayan [EMAIL PROTECTED] writes:
Ornegin soyle bir listem var:'(0 1 1 0 0 1 1)
ve ben su cevabi ariyorum: '(1 2 5 6)
CL-USER (defun positions (item list)
POSITION derivate returns list of positions of the
supplied ITEM occuring in the specified LIST.
;; binary position
(defun pos (item list pos-list)
(if (not (null list))
(if (= item (car list))
(pos item (cdr list) (cons 1 pos-list))
(pos item (cdr list) (cons 0 pos-list)))
(reverse pos-list)))
;; cumulative position
(defun bin2cum (pos cum-pos cum)
(if
On Thu, Apr 24, 2008 at 09:36:22AM +0300, Volkan YAZICI wrote:
Merhaba,
Can Burak Cilingir [EMAIL PROTECTED] writes:
Problemi eger dogru tahmin ediyorsam, bahsettiginiz isi list veritipi
kullanarak yapmak yerine girdilerini nept veritipine cevirerek daha
performansli calisabileceginizi
On Thu, Apr 24, 2008 at 01:40:39PM +0300, Volkan YAZICI wrote:
Can Burak Cilingir [EMAIL PROTECTED] writes:
(N)ear (e)valuated (p)riority (t)ree veri tipi icerisinde sakladiginiz
veriyi sirali olsun, olmasin BST (binary search tree) benzeri bir
sekilde calisarak aradiginiz veriye en fazla
4 matches
Mail list logo
