tree 1bd5a9ca021dfba12df0a97244543266fd8f2776
parent 91ab0425cc7b8268918a630b787b572528ce7ec4
author aherbert <aherbert@apache.org> 1626875983 +0100
committer aherbert <aherbert@apache.org> 1626875983 +0100

Use binary search for the quartile

This reduces the comparisons to 2 for all points. Previous algorithm
had:

25% - 1
25% - 2
50% - 3

Mean = 2.25