Anonymous user
K-d tree: Difference between revisions
replace lambda for sorting (more common to have `key=lambda v: some_value`)
(replace lambda for sorting (more common to have `key=lambda v: some_value`)) |
|||
Line 968:
<lang python>from random import seed, random
from time import clock
from collections import namedtuple
from math import sqrt
Line 1,000 ⟶ 999:
if not exset:
return None
exset.sort(key=
m = len(exset) // 2
d = exset[m]
while m + 1 < len(exset) and exset[m
m += 1
| |||