Please Help In JAVA Here is the skeleton of a code for insertion sorting in a functional language. You have to add right lines of codes for the language you choose (C, C++, C#, JAVA etc,). The following sample is for C++ (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)))))) ;; Exp. (insertionsort '(4 2 10 3 -1 5)) ==> (-1 2 3 4 5 10) (define (insertionsort L) (if (null? L) '() (insert (list (car L)) (insertionsort (cdr L))))) (define (random-list n) (unless (exact-nonnegative-integer? n) (raise-argument-error 'make-list "exact-nonnegative-integer?" 0 n)) (let loop ([n n] [r '()]) (if (zero? n) r (loop (sub1 n) (cons (random 2147483647) r))))) Sample function call: (insertionsort (random-list 10000)) Hint: most languages have some function to determine the runtime of functions
Please Help In JAVA
Here is the skeleton of a code for insertion sorting in a functional language. You have to add right lines of codes for the language you choose (C, C++, C#, JAVA etc,). The following sample is for C++
(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))))))
;; Exp. (insertionsort '(4 2 10 3 -1 5)) ==> (-1 2 3 4 5 10)
(define (insertionsort L)
(if (null? L) '()
(insert (list (car L)) (insertionsort (cdr L)))))
(define (random-list n)
(unless (exact-nonnegative-integer? n)
(raise-argument-error 'make-list "exact-nonnegative-integer?" 0 n))
(let loop ([n n] [r '()])
(if (zero? n) r (loop (sub1 n) (cons (random 2147483647) r)))))
Sample function call:
(insertionsort (random-list 10000))
Hint: most languages have some function to determine the runtime of functions
Step by step
Solved in 2 steps with 2 images
