PLEASE HELP IN FUNCTIONAL PROGRAMMING CODE I have to insert a few lines to generate random numbers and for determining the time taken to get results   (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))

Computer Networking: A Top-Down Approach (7th Edition)
7th Edition
ISBN:9780133594140
Author:James Kurose, Keith Ross
Publisher:James Kurose, Keith Ross
Chapter1: Computer Networks And The Internet
Section: Chapter Questions
Problem R1RQ: What is the difference between a host and an end system? List several different types of end...
icon
Related questions
Question

PLEASE HELP IN FUNCTIONAL PROGRAMMING CODE

I have to insert a few lines to generate random numbers and for determining the time taken to get results

 

(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))

Expert Solution
steps

Step by step

Solved in 4 steps with 2 images

Blurred answer
Knowledge Booster
Linked List Representation
Learn more about
Need a deep-dive on the concept behind this application? Look no further. Learn more about this topic, computer-engineering and related others by exploring similar questions and additional content below.
Recommended textbooks for you
Computer Networking: A Top-Down Approach (7th Edi…
Computer Networking: A Top-Down Approach (7th Edi…
Computer Engineering
ISBN:
9780133594140
Author:
James Kurose, Keith Ross
Publisher:
PEARSON
Computer Organization and Design MIPS Edition, Fi…
Computer Organization and Design MIPS Edition, Fi…
Computer Engineering
ISBN:
9780124077263
Author:
David A. Patterson, John L. Hennessy
Publisher:
Elsevier Science
Network+ Guide to Networks (MindTap Course List)
Network+ Guide to Networks (MindTap Course List)
Computer Engineering
ISBN:
9781337569330
Author:
Jill West, Tamara Dean, Jean Andrews
Publisher:
Cengage Learning
Concepts of Database Management
Concepts of Database Management
Computer Engineering
ISBN:
9781337093422
Author:
Joy L. Starks, Philip J. Pratt, Mary Z. Last
Publisher:
Cengage Learning
Prelude to Programming
Prelude to Programming
Computer Engineering
ISBN:
9780133750423
Author:
VENIT, Stewart
Publisher:
Pearson Education
Sc Business Data Communications and Networking, T…
Sc Business Data Communications and Networking, T…
Computer Engineering
ISBN:
9781119368830
Author:
FITZGERALD
Publisher:
WILEY