iverase commented on pull request #91: URL: https://github.com/apache/lucene/pull/91#issuecomment-823957855
What I read for this results is that the stable sorting is faster than the non-stable. I think it makes sense because re-ordering using a helper array is probably faster that in-place re-ordering. If we are ok to take the memory penalty of using this extra array, then I think it make sense to always use the stable version of the algorithm? -- 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. For queries about this service, please contact Infrastructure at: us...@infra.apache.org --------------------------------------------------------------------- To unsubscribe, e-mail: issues-unsubscr...@lucene.apache.org For additional commands, e-mail: issues-h...@lucene.apache.org
