Anonymous user
K-d tree: Difference between revisions
m
→{{header|Racket}}: No need for random-real from srfi-27
m (→{{header|Racket}}: No need for random-real from srfi-27) |
|||
Line 955:
<lang racket>
#lang racket
; A tree consists of a point, a left and a right subtree.
Line 1,036 ⟶ 1,035:
(define (test k n)
(define (random!) (for/vector ([_ k]) (random
(define points (for/list ([_ n]) (random!)))
(define t (kdtree 0 k points))
| |||