Racket Programming -- 2

Job ID: 33059642

Budget: $10 – $100 USD

#lang racket

; Quad-trees and immutable data-structures

(provide total-rect-area)

; total-rect-area: returns the total integer area covered by any (one or more) rectangles in the given list
; Don't double-count. Should be identical to the same solution from e3.rkt, except this version must be in O(n log n)
; Hint: implement an immutable quad-tree to represent 2D space; FYI, a solution takes only ~30-40 lines of code.
(define (total-rect-area rect-list)
'todo)
To configure: you might need to add racket into your computer for no timeout situations......
Folder with test cases and a python tester to test current code to see if it passes the tester.
You will need to modify "todo" in the rectangle-coverage.rkt file to the corresponding comments provided by each function.
Also it has a autograder file known as tester.py that will test the .rkt file to see if it passes the tester.
Navigate into terminal and test the code with python3 tester.py -a to see if it passes the autograder.
To navigate folder...../138@p2/<main folder> then python3 tester.py -a to see if it passes the autograder

I have uploaded the .zip as entire folder
Have 2 other files to help with the assignment as well
e3.rkt and helper.rkt
Related categories: Python Lisp Scheme Racket