Quick Sort Using ListProcessing..Just try it..or modifies it

(defun quicksort(L)
(cond ((null L) nil)
((null (cdr L)) L )
(t (append (quicksort(car (partition (car L) (cdr L))))
(quicksort(cadr(partition (car L) (cdr L)))) )) ) )
(defun partition(el L)

(cond ((null (cdr L))
(cond ((< el (car L)) (list (list el) L))
( t (list L (list el))) ) )
(t (cond ((< el (car L))(list (car (partition el (cdr L)))
(cons(car L)(cadr(partition el (cdr L)))) ))
(t (list (cons(car L)(car (partition el (cdr L))))