Маленький бенчмарк и его результаты:
lisp:
(defun simple(max)
"Search for simple numbers up to max"
(setq current-numbers (list 2))
(do ((num 3 (incf num 2)))
((> num max))
(setf found T)
(dolist (prev current-numbers)
(if (= 0 (mod num prev)) (PROGN (setf found NIL) (return)))
(if (> prev (/ num 2)) (return)))
(if found (PROGN (nconc current-numbers (list num))
(print num)))
)
)
(simple 100000)
python:
numbers = [2]
maxNum = 100000
new = 1
for i in xrange(3,maxNum):
for j in numbers:
if j>i/2:
break
if i%j == 0:
new = 0
break
if new == 1:
print i
numbers.append(i)
new = 1
print "\nTotal numbers: ",len(numbers)
*Итоги*:
*clisp:*
real 1m28.242s
user 1m27.110s
sys 0m1.266s
*sbcl:*
real 0m6.794s
user 0m6.615s
sys 0m0.114s
*python:*
real 0m10.486s
user 0m10.446s
sys 0m0.017s
за лиспокод не пинать - поиск простых чисел это мой hello world за последние 15 лет.
