←back to thread

1764 points fatihky | 1 comments | | HN request time: 0.406s | source
Show context
sonoffett ◴[] No.12701639[source]
quicksort is O(n^2) which is definitely not the "best big-O" for sorting.
replies(4): >>12701670 #>>12701718 #>>12701729 #>>12701867 #
sonoffett ◴[] No.12701670[source]
"how do you count the bits most efficiently?"

What does this even mean?

replies(2): >>12701753 #>>12701756 #
1. dekhn ◴[] No.12701756[source]
If you have a collection of data, and you want to know the number of 1 bits, and you want to do it with a minimum of resources... what is the process?

For example, standard bit-shifting and masking the lowest bit to set a counter is one way to do this. Possibly there are other, faster ways, such as using a lookup table (a byte or more can be "counted" at a time). Of course, because so many people were doing this, intel added a popcnt instruction which probably is more efficient (faster) than either of the above, at the expense of more CPU real estate, heat, etc.

Turns out counting 1 bits in a dataset is a super-important problem that shows up in a lot of situations.