anchor.diff:     (= (euclidean-norm-r (load-vector-r "N11.TestData.txt"))
   ;       (euclidean-norm-r (load-vector-i "N11.TestData.txt"))
         (euclidean-norm-i (load-vector-i "N11.TestData.txt")))
  +   "Tests whether search result of longest ascending sequence search is correct."
  +   (= (longest-ascendings-length-i `(1 2 3 1 2 3 4 1 2 3)) 4)
     )
   )
positive.code: (defun sqr-summ-r (vector)
    (if (eq vector nil) nil
        (if (eq (list-length vector) 1) (expt (car vector) 2)
  	  (+ (expt (car vector) 2) (sqr-summ (cdr vector))))))
  
  (defun euclidean-norm-r (vector)
    (sqrt (sqr-summ-r vector)))
  
negative.code:     (dolist (el vector) (setq summ (+ summ (expt el 2))))
      (sqrt summ)))
  
  (defun ascendings-length-i (vector &optional (i 0))
    (let ((l (list-length vector)))
      (if (<= (- l i) 0) 0
  	(if (= (- l i) 1) 1
  	    (let ((k 1))
  	      (setq l (- l 1))
  	      (loop while (and (< i l)
  			       (< (nth i vector) (nth (+ i 1) vector))) do
  		   (setq i (+ i 1) k (+ k 1)))
  	      k)))))
  
  (defun longest-ascendings-length-i (vector)
    (let ((l (list-length vector)) (i 0) (k 0) tmp)
      (loop while (< i l) do
  	 (setq tmp (ascendings-length-i vector i) i (+ i tmp))
  	 (if (< k tmp) (setq k tmp)))
      k))
  
  (defun lieq (list1 list2)
    (if (or (eq list1 nil) (eq list2 nil))
  