[FEATURE] Merge Sort Tree

Question

[FEATURE] Merge Sort Tree

fffelix-huang opened this issue a year ago · 2 comments

fffelix-huang commented a year ago

Detailed description

A merge sort tree data structure, which supports the following operations:

$[l, r, k]$: Count number of elements $< k$ (could be replaced with $\leq, >, \geq$) in $a_l, a_{l+1}, \dots, a_{r}$ in $O(\log^2 n)$.

Context

Please assign this to me under hacktoberfest.

Possible implementation

No response

Additional information

No response

Answer 1 · 2024-11-12T00:12:54.000Z

This issue has been automatically marked as abandoned because it has not had recent activity. It will be closed if no further activity occurs. Thank you for your contributions.

Answer 2 · 2024-12-08T00:15:48.000Z

Please ping one of the maintainers once you add more information and updates here. If this is not the case and you need some help, feel free to ask for help in our Gitter channel or our Discord server. Thank you for your contributions!