You often need to sort an array of vectors. This allows you to do it without knowing the optimal ranking function and with some pairs of vectors that are not even comparable.

See describe "examples" do in specs.

Don't mutate the key objects after you store them in PCBR instance.

The first idea was in 2013 -- at that time I was imagining it as a tree data structure. Later in May 2015 I've realised that it's really about dots in n-dimensional space and sectors, and round-robin. Applying it to Reddit RSS feed made it 50% more interesting. It also applied well to boost tree search process in the bad Facebook advertisment classifier production project. Since then I mostly use it to oprimize tree searches, it's basically an automated replacement for euristics.

gem install pcbr

ruby test.rb

Add illustrate to this README. Add Github Action.