summaryrefslogtreecommitdiff
path: root/LICENSE
diff options
context:
space:
mode:
authorJSDurand <mmemmew@gmail.com>2023-03-11 16:21:20 +0800
committerJSDurand <mmemmew@gmail.com>2023-03-11 16:21:20 +0800
commit89e82439186c6dfa48a73bddc0908a494fbd4394 (patch)
tree595b798be4adc66d202850303b0041b4de7a2ac7 /LICENSE
parent45394c7cc8f6191e88edd6280b308ae69f588376 (diff)
optimize the implementation
Now the double for loop is eliminated and the time complexity is indeed O(n log(n)). Also added (micro)-benchmarks to roughly confirm the time complexity is as predicted.
Diffstat (limited to 'LICENSE')
0 files changed, 0 insertions, 0 deletions