(www.gwan.com)

1764 points fatihky | 2 comments | 13 Oct 16 15:15 UTC | HN request time: 0.54s | source

Show context

sonoffett ◴[13 Oct 16 15:58 UTC] No.12701639[source]▶

quicksort is O(n^2) which is definitely not the "best big-O" for sorting.

sonoffett ◴[13 Oct 16 16:03 UTC] No.12701670[source]▶

"how do you count the bits most efficiently?"

What does this even mean?

1. UK-AL ◴[13 Oct 16 16:12 UTC] No.12701753[source]▶

What i think he means is counting the amount of set(1) bits in the array,

replies(1): >>12701768 #

2. sonoffett ◴[13 Oct 16 16:13 UTC] No.12701768[source]▶

Thanks, the question makes more sense now :)

Google's “Director of Engineering” Hiring Test