Not a member of Pastebin yet?
Sign Up,
it unlocks many cool features!
- qsort [] = []
- qsort (x:xs) = qsort (filter (< x) xs) ++ [x] ++ qsort (filter (>= x) xs)
- (defun quicksort (lis) (if (null lis) nil
- (let* ((x (car lis)) (r (cdr lis)) (fn (lambda (a) (< a x))))
- (append (quicksort (remove-if-not fn r)) (list x)
- (quicksort (remove-if fn r))))))
- qsort [] = []
- qsort (x:xs) = qsort (filter (< x) xs) ++ [x] ++ qsort (filter (>= x) xs)
- (defun quicksort (lis) (if (null lis) nil
- (let* ((x (car lis)) (r (cdr lis)) (fn (lambda (a) (< a x))))
- (append (quicksort (remove-if-not fn r)) (list x)
- (quicksort (remove-if fn r))))))
- if len(L) <= 1: return L
- 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]])
- print( loadstring( "return " .. io.read() )() )
- lindex $mylist end-2
- auto
- auto
- auto
Add Comment
Please, Sign In to add comment