e. (10 points) Define a function op-sort that accepts only a numeric comparison predicate and a...

 

Transcribed Image Text:

e. (10 points) Define a function op-sort that accepts only a numeric comparison predicate and a list of numbers as arguments, in that order, and returns the list of numbers sorted by the predicate. Do not use more than one method definition and follow the guidelines above (you will need to use letrec). Examples: Welcome to DrRacket, version 7.5 [3m]. Language: racket, with debugging; memory limit: 128 MB. CPS 352 Assignment 2 by Your Name > (op-sort < '()) 0 >(op-sort < (3)) (3) > (op-sort < (3 2)) (2 3) > (op-sort < '(3 2 1)) (1 2 3) > (op-sort < (9 8 7 6 5 4 3 2 1)) (1 2 3 4 5 6789) > (op-sort > '()) >(op-sort > '(1)) ' (1) > (op-sort > '(1 2)) (21) > (op-sort > '(1 2 3)) '(321) > (op-sort > (1 2 3 4 5 6 7 8 9)) (9 8 7 6 5 4 3 2 1) e. (10 points) Define a function op-sort that accepts only a numeric comparison predicate and a list of numbers as arguments, in that order, and returns the list of numbers sorted by the predicate. Do not use more than one method definition and follow the guidelines above (you will need to use letrec). Examples: Welcome to DrRacket, version 7.5 [3m]. Language: racket, with debugging; memory limit: 128 MB. CPS 352 Assignment 2 by Your Name > (op-sort < '()) 0 >(op-sort < (3)) (3) > (op-sort < (3 2)) (2 3) > (op-sort < '(3 2 1)) (1 2 3) > (op-sort < (9 8 7 6 5 4 3 2 1)) (1 2 3 4 5 6789) > (op-sort > '()) >(op-sort > '(1)) ' (1) > (op-sort > '(1 2)) (21) > (op-sort > '(1 2 3)) '(321) > (op-sort > (1 2 3 4 5 6 7 8 9)) (9 8 7 6 5 4 3 2 1)