[An order statistic tree to JDK?]

Rodion Efremov coderodd3 at gmail.com
Wed Jun 15 03:46:19 UTC 2022


Hello community,

I have implemented an order statistic tree using the ALV algorithm and,
thus, running all single element methods in worst case logarithmic time
[1]. Basically, it’s a sorted list that allows:
(1) accessing the ith element in O(log n),
(2) getting the index of an input object, runs also in O(log n).

What do you think? Does it have a chance of ending up in JDK?

Best regards,
rodde

[1]
https://github.com/coderodde/OrderStatisticTree/blob/master/src/main/java/net/coderodde/util/OrderStatisticsTree.java
-------------- next part --------------
An HTML attachment was scrubbed...
URL: <https://mail.openjdk.org/pipermail/core-libs-dev/attachments/20220615/537360e8/attachment-0001.htm>


More information about the core-libs-dev mailing list