Sort a list in scheme

Question

I want to create function which sorts list. For example I have this list:

x1, x2, x3 .... xn

or

1, 2, 3, 4, 5, 6

Answer 1

Usually when we talk about sorting, we refer to ordering the items by some characteristic of the item contents, not the item position in the list. I would call your situation permuting, but perhaps some people might dispute that usage, too. :-)

Here's how you might approach the problem:

1. Split the list in the middle (you can do this using tortoise-and-hare if you only want to traverse the list once); call those lists head and tail, if you want.
2. Reverse the tail list, and interleave it with the head list.

Another approach:

1. Reverse the original list pairs (let's call it rev).
2. Interleave the original list with rev, keeping track of the element traversed each time. When they meet in the middle, stop.

Here's a demonstration of the second approach (requires SRFI 1 to be loaded):

(define (zippy lst)
  (if (null? lst)
      '()
      (let recur ((lst lst)
                  (rev (pair-fold cons '() lst)))
        (cond ((eq? lst (car rev)) (list (car lst)))
              ((eq? (cdr lst) (car rev)) (list (car lst) (caar rev)))
              (else (cons* (car lst) (caar rev)
                           (recur (cdr lst) (cdr rev))))))))