User talk:Kyzyltanatuva

k-D tree comment: A reviewer may already have observed this, but the Python program (I read a little Python, but do not write in it) seems to be happy selecting the median as the middle value in a list. Consider ((1 1) (1 2) (1 3) (1 4) (1 5) (1 6) (1 7)). Splitting at (1 4) will send half of the remaining median values to the left, half to the right. When searching, depending on a > or a >= comparison, all points will go the same way, which means you miss half the entries. Better to split using the smallest ordered entry that has the median value.--Kyzyltanatuva (talk) 16:30, 18 December 2011 (UTC)