Talk:Sorting algorithms/Stooge sort: Difference between revisions
Talk:Sorting algorithms/Stooge sort (view source)
Revision as of 15:19, 5 August 2010
, 13 years agono edit summary
(problem with lisp code) |
No edit summary |
||
Line 3:
(define (stoogesort L left right)
(println "list : " L " left: " left " right: " right " calc: " (- right (/ (- right (+ left 1))3)))
(stoogesort
(stoogesort(L (+ left (/ (- right (+ left 1))3)) right▼
(stoogesort
(stoogesort(L left (- right (/ (- right (+ left 1))3)))))))))))
L)
Line 20 ⟶ 24:
It seems to never get to the recursive step. I'm wondering why as I did some other tests to see whats going on. I feel extremely dumb right now with such an algorithm....
--Michael Chrisco
:I do not know enough about Newlisp to be very helpful, but I formatted your code to better represent matching parenthesis. (I am stuck on: How does L work in the function position of a list when composing arguments for nested stoogesorts? Also, what modifies the L which you return from your defined function?) --[[User:Rdm|Rdm]] 15:19, 5 August 2010 (UTC)
| |||