miyukino

;; Exp. (list-reverse '(1 (2 3) (4 (5 6) (7 8 (9))))) ==> ((((9) 8 7) (6 5) 4) (3 2) 1)
(define (list-reverse L)
	(if (null? L) L
		(if (list? (car L))
			(append (list-reverse (cdr L)) (cons (list-reverse (car L)) '()))
			(append (list-reverse (cdr L)) (list (car L))))))

miyukino

;; same as the merge function in MergeSort.scm
(define (insert L M)
	(if (null? L) M
		(if (null? M) L
			(if (< (car L) (car M))
				(cons (car L) (insert (cdr L) M))
				(cons (car M) (insert (cdr M) L))))))

;; another insert function
;; need to modify the first para in insertionsort function to (car L)

miyukino

;; Exp. (merge '(1 3 5 7 8 9 10) '(2 4 6)) ==> (1 2 3 4 5 6 7 8 9 10)
(define (merge L M)
	(if (null? L) M
		(if (null? M) L
			(if (< (car L) (car M))
				(cons (car L) (merge (cdr L) M))
				(cons (car M) (merge (cdr M) L))))))

;; split helper functions
(define (odd L)