You are viewing a plain text version of this content. The canonical link for it is here.

Posted to issues@lucene.apache.org by GitBox <gi...@apache.org> on 2021/11/04 10:44:40 UTC

[GitHub] [lucene] bruno-roustant commented on pull request #426: Javadocs, Sorter impls:

bruno-roustant commented on pull request #426:
URL: https://github.com/apache/lucene/pull/426#issuecomment-960639927


   Thanks David for bringing clarity there!
   I think the quality of the in-place merge sort is to be stable, and more efficient (O(n.log(n)) on larger arrays than the binary sort or insertion sort (O(n2)).


-- 
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: issues-unsubscribe@lucene.apache.org

For queries about this service, please contact Infrastructure at:
users@infra.apache.org



---------------------------------------------------------------------
To unsubscribe, e-mail: issues-unsubscribe@lucene.apache.org
For additional commands, e-mail: issues-help@lucene.apache.org