LR1_Khapusova, Common Lisp

Language: Layout:

(defun endcons (a v)
   (if (null v) (cons a nil) (cons (car v) (endcons a (cdr v)))))

(defun issorted (lst n)
    (if (= n (- (length lst) 1)) 1 (if (STRING< (nth n lst) (nth (+ n 1) lst)) 0(issorted lst (+ n 1)))))

(defun changing-two (lst ind n)
    (if (< n ind) (changing-two lst ind (+ n 1)) 
        (if (= ind 0)  (append (endcons (nth (+ n 1) lst) ()) (endcons (nth n lst) ()) (subseq lst  (+ ind 2)))
            (if (= (+ ind 1) (- (length lst) 1)) (append (subseq lst 0 ind )  (endcons (nth (+ n 1) lst) ())   (endcons (nth n lst) ()))
                (append (subseq lst 0 ind)(endcons (nth (+ n 1) lst) ())(endcons (nth n lst) ())(subseq lst (+ ind 2)))
             ))))

(defun sortinng (lst n)
    (if (= (issorted lst 0) 1) lst
        (if (= n (- (length lst) 1)) (sortinng lst 0)
            (if ( STRING<= (nth n lst) (nth (+ n 1) lst)) (sortinng (changing-two lst n 0) (+ n 1))  (sortinng lst (+ n 1)
                )
         ))))
   
(write(sortinng '(a a d b v d a ) '0))

[ + ] Show input
Absolute running time: 0.16 sec, cpu time: 0.02 sec, memory peak: 9 Mb, absolute service time: 0,25 sec