3 ms·
If you're complaining because it's faster than O(N*log(N)), the fixed key size guarantees you'll never meet a sufficiently large N which is required when doing
by gleenn 11y ago
If you're complaining because it's faster than O(N*log(N)), the fixed key size guarantees you'll never meet a sufficiently large N which is required when doing big-oh analysis.
If you're complaining because of the k, k is the number of bits in the key and it's perfectly reasonable to have that spelled out explicitly.
- minimax 11y agoI wouldn't say it was a complaint but the k is definitely what caught my attention. https://en.wikipedia.org/wiki/Big_O_notation#Multiplication_by_a_constant https://en.wikipedia.org/wiki/Big_O_notation#Multiplication_...