| Sysop: | Amessyroom |
|---|---|
| Location: | Fayetteville, NC |
| Users: | 27 |
| Nodes: | 6 (0 / 6) |
| Uptime: | 38:57:59 |
| Calls: | 631 |
| Calls today: | 2 |
| Files: | 1,187 |
| D/L today: |
23 files (29,781K bytes) |
| Messages: | 174,061 |
(defun find-longest-name (array-of-symbols)
(let ((longest (aref array-of-symbols 0))) ;!!! assumes at least one elt
(loop for i from 1 below (length array-of-symbols)
for contender = (aref array-of-symbols i)
when (> (length (string longest))
(length (string contender)))
do (setf longest contender))
longest))
Kent M. Pitman wrote:
(defun find-longest-name (array-of-symbols)
(let ((longest (aref array-of-symbols 0))) ;!!! assumes at least one elt
(loop for i from 1 below (length array-of-symbols)
for contender = (aref array-of-symbols i)
when (> (length (string longest))
(length (string contender)))
do (setf longest contender))
longest))
Gauche Scheme
(use gauche.sequence)
(define (find-longest-name vec-of-symbols)
(do ((names (map x->string vec-of-symbols))
(longest ""))
((null? names) longest)
(set! longest
(car (sort (list longest (pop! names)) > size-of)))))
(find-longest-name #(one two three four))
===>
"three"