Talk:Sorting algorithms/Stooge sort

Im having a bit of an issue with syntax apparently. I have the latest code here: <lang Newlisp>

(define (stoogesort L left right)

 (println "list : " L " left: " left " right: " right " calc: " (- right (/ (- right (+ left 1))3)))
 (if (> ( L left ) ( L right )) 
   (swap  (L left)  (L right) 
     (if (< (- left right) 1) (print "hello")
       (stoogesort
         (L left (- right (/ (- right (+ left 1))3))
           (stoogesort
             (L (+ left (/ (- right (+ left 1))3)) right
               (stoogesort(L left (- right (/ (- right (+ left 1))3)))))))))))
 L)

(stoogesort (list 7 3 2 3 4 0) 0 5)

</lang> 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 -- or was L supposed to be the else clause on your if statement -- if so I think it needs to be moved over inside the parenthesis to its left?) --Rdm 15:19, 5 August 2010 (UTC)

WP markup reference problem

The wikipedia markup tag creates an article reference that creates a new article and doesn't reference the actual article. Not sure how to fix. --Dgamey 14:36, 12 September 2010 (UTC)