Subject: [boost] Fast nth-elemnt on the segment
From: ÐÐ°Ð¹ÑÐµÐ² ÐÐ»ÐµÐºÑÐ°Ð½Ð´Ñ (zamazan4ik_at_[hidden])
Date: 2016-07-26 09:31:24
What do you think about algorithm of fast searching nth-elemnt on the segment with O(logN), where N is count of elements.
I would implement it to Boost.Algorithm.
Best regards, Alexander Zaitsev
Boost list run by bdawes at acm.org, gregod at cs.rpi.edu, cpdaniel at pacbell.net, john at johnmaddock.co.uk