Re:Ask HN: What is your favorite CS paper?
by NewEntryHN on Thursday August 24, 2017 @04:45PM
(#15093891)
> Are they saying O(n) operations where each operation operates on O(log n) bits
Yes, as in any other claimed complexity about an algorithm. According to your proof finding the maximum in a list is Ω(n log n), which isn't the commonly used measure.
Yes, as in any other claimed complexity about an algorithm. According to your proof finding the maximum in a list is Ω(n log n), which isn't the commonly used measure.