Recursive euclidean distance
问题 I was tasked to write a recursive euclidean distance. I have been googling around but could not find any sample. I understand the function of euclidean distance and has no problem writing it in an iterative manner as shown below. Is there anyone who could advise me on how I should start for the recursive function? The requirement is the same as the iterative version. Thanks. (defun euclidean-distance-it (p q) (cond ((or (null p) (null q)) nil) ;return nil if either list is null ((or (atom p)