code_junkie

What do people find so appealing about dynamic languages? [closed]

Nov 10th, 2011
119
0
Never
Not a member of Pastebin yet? Sign Up, it unlocks many cool features!
text 0.81 KB | None | 0 0
  1. qsort [] = []
  2. qsort (x:xs) = qsort (filter (< x) xs) ++ [x] ++ qsort (filter (>= x) xs)
  3.  
  4. (defun quicksort (lis) (if (null lis) nil
  5. (let* ((x (car lis)) (r (cdr lis)) (fn (lambda (a) (< a x))))
  6. (append (quicksort (remove-if-not fn r)) (list x)
  7. (quicksort (remove-if fn r))))))
  8.  
  9. qsort [] = []
  10. qsort (x:xs) = qsort (filter (< x) xs) ++ [x] ++ qsort (filter (>= x) xs)
  11.  
  12. (defun quicksort (lis) (if (null lis) nil
  13. (let* ((x (car lis)) (r (cdr lis)) (fn (lambda (a) (< a x))))
  14. (append (quicksort (remove-if-not fn r)) (list x)
  15. (quicksort (remove-if fn r))))))
  16.  
  17. if len(L) <= 1: return L
  18. return qsort([lt for lt in L[1:] if lt < L[0]]) + [L[0]] + qsort([ge for ge in L[1:] if ge >= L[0]])
  19.  
  20. print( loadstring( "return " .. io.read() )() )
  21.  
  22. lindex $mylist end-2
  23.  
  24. auto
  25.  
  26. auto
  27.  
  28. auto
Add Comment
Please, Sign In to add comment