You are viewing a plain text version of this content. The canonical link for it is here.
Posted to notifications@shardingsphere.apache.org by GitBox <gi...@apache.org> on 2022/02/15 08:15:13 UTC
[GitHub] [shardingsphere] carteruu opened a new issue #15413: 合并m个长度为n的已排序数组的时间复杂度为O(mn(log m))，按照原文举的例子，分片数量m为2时，时间复杂度为O(n)，原文并没有问题，只是表述有歧义。
carteruu opened a new issue #15413:
URL: https://github.com/apache/shardingsphere/issues/15413
合并m个长度为n的已排序数组的时间复杂度为O(mn(log m))，按照原文举的例子，分片数量m为2时，时间复杂度为O(n)，原文并没有问题，只是表述有歧义。
而且一般分片数量都不会很大，基本可以认为是O(n)。
_Originally posted by @carteruu in https://github.com/apache/shardingsphere/issues/9745#issuecomment-1039961458_
--
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: notifications-unsubscribe@shardingsphere.apache.org
For queries about this service, please contact Infrastructure at:
users@infra.apache.org
[GitHub] [shardingsphere] carteruu closed issue #15413: 合并m个长度为n的已排序数组的时间复杂度为O(mn(log m))，按照原文举的例子，分片数量m为2时，时间复杂度为O(n)，原文并没有问题，只是表述有歧义。
Posted by GitBox <gi...@apache.org>.
carteruu closed issue #15413:
URL: https://github.com/apache/shardingsphere/issues/15413
--
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: notifications-unsubscribe@shardingsphere.apache.org
For queries about this service, please contact Infrastructure at:
users@infra.apache.org
[GitHub] [shardingsphere] terrymanu closed issue #15413: 合并m个长度为n的已排序数组的时间复杂度为O(mn(log m))
Posted by GitBox <gi...@apache.org>.
terrymanu closed issue #15413:
URL: https://github.com/apache/shardingsphere/issues/15413
--
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: notifications-unsubscribe@shardingsphere.apache.org
For queries about this service, please contact Infrastructure at:
users@infra.apache.org
[GitHub] [shardingsphere] terrymanu commented on issue #15413: 合并m个长度为n的已排序数组的时间复杂度为O(mn(log m))
Posted by GitBox <gi...@apache.org>.
terrymanu commented on issue #15413:
URL: https://github.com/apache/shardingsphere/issues/15413#issuecomment-1040047661
**For English only**, other languages will not accept.
--
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: notifications-unsubscribe@shardingsphere.apache.org
For queries about this service, please contact Infrastructure at:
users@infra.apache.org
[GitHub] [shardingsphere] terrymanu closed issue #15413: 合并m个长度为n的已排序数组的时间复杂度为O(mn(log m))
Posted by GitBox <gi...@apache.org>.
terrymanu closed issue #15413:
URL: https://github.com/apache/shardingsphere/issues/15413
--
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: notifications-unsubscribe@shardingsphere.apache.org
For queries about this service, please contact Infrastructure at:
users@infra.apache.org
[GitHub] [shardingsphere] carteruu closed issue #15413: 合并m个长度为n的已排序数组的时间复杂度为O(mn(log m))，按照原文举的例子，分片数量m为2时，时间复杂度为O(n)，原文并没有问题，只是表述有歧义。
Posted by GitBox <gi...@apache.org>.
carteruu closed issue #15413:
URL: https://github.com/apache/shardingsphere/issues/15413
--
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: notifications-unsubscribe@shardingsphere.apache.org
For queries about this service, please contact Infrastructure at:
users@infra.apache.org
[GitHub] [shardingsphere] carteruu commented on issue #15413: 合并m个长度为n的已排序数组的时间复杂度为O(mn(log m))
Posted by GitBox <gi...@apache.org>.
carteruu commented on issue #15413:
URL: https://github.com/apache/shardingsphere/issues/15413#issuecomment-1039997942
1
--
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: notifications-unsubscribe@shardingsphere.apache.org
For queries about this service, please contact Infrastructure at:
users@infra.apache.org
[GitHub] [shardingsphere] terrymanu commented on issue #15413: 合并m个长度为n的已排序数组的时间复杂度为O(mn(log m))
Posted by GitBox <gi...@apache.org>.
terrymanu commented on issue #15413:
URL: https://github.com/apache/shardingsphere/issues/15413#issuecomment-1040047661
**For English only**, other languages will not accept.
--
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: notifications-unsubscribe@shardingsphere.apache.org
For queries about this service, please contact Infrastructure at:
users@infra.apache.org
[GitHub] [shardingsphere] carteruu commented on issue #15413: 合并m个长度为n的已排序数组的时间复杂度为O(mn(log m))
Posted by GitBox <gi...@apache.org>.
carteruu commented on issue #15413:
URL: https://github.com/apache/shardingsphere/issues/15413#issuecomment-1039997942
1
--
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: notifications-unsubscribe@shardingsphere.apache.org
For queries about this service, please contact Infrastructure at:
users@infra.apache.org