Closed psuong closed 3 years ago
I made a naive implementation to test out my idea for building dynamic text in order, a minified heap would work much better for fetching min values (log(n) vs o(n)).
Closing this issue since I moved away from a min heap in favor of sorting.
I made a naive implementation to test out my idea for building dynamic text in order, a minified heap would work much better for fetching min values (log(n) vs o(n)).