That seems very likely. The benchmark should probably use a range that is guaran... | Hacker News

Hacker Newsnew | past | comments | ask | show | jobs | submit

		bgwalter 4 months ago \| parent \| context \| favorite \| on: Is Python Code Sensitive to CPU Caching? (2024) That seems very likely. The benchmark should probably use a range that is guaranteed to be outside of the cached smallint range.

exyi 4 months ago [–]

Then you are back to what the article discusses. Each integer is in a separate box, those boxes are allocated in one order, sorting the array by value will shuffle it by address and it will be much slower. I tested this as well, see the other comment.

Guidelines | FAQ | Lists | API | Security | Legal | Apply to YC | Contact