carteruu removed a comment on pull request #9745: URL: https://github.com/apache/shardingsphere/pull/9745#issuecomment-1039961458
合并m个长度为n的已排序数组的时间复杂度为O(mn(log m))，按照原文举的例子，分片数量m为2时，时间复杂度为O(n)，原文并没有问题，只是表述有歧义。 而且一般分片数量都不会很大，基本可以认为是O(n)。 -- This is an automated message from the Apache Git Service. To respond to the message, please log on to GitHub and use the URL above to go to the specific comment. To unsubscribe, e-mail: [email protected] For queries about this service, please contact Infrastructure at: [email protected]
