bruno-roustant commented on pull request #430: URL: https://github.com/apache/lucene/pull/430#issuecomment-964200668
> Is it actually faster to fall back to insertion sort on small arrays rather than using the median-of-medians algorithm? Indeed if we don't use insertion sort, we can be faster on random-like data (+ 10-20%) while being slower on ascending-like data (- 5-10%). I'll do that. > Do you know if we would be able to speed up the selection process by changing the way we choose the pivot when k is close to from or last? I don't think with the pivot, but I can think of a specialized algorithm that I suppose would be faster for k really close to from and to. What do you mean by 'close'? Is it less than 10? -- 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-unsubscr...@lucene.apache.org 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
