3 ms·
Why would it be too imprecise? I agree there are some (many?) problems with some definitions used in complexity theory, but "size of input" is certainly not pa
by qsort 5y ago
Why would it be too imprecise?
I agree there are some (many?) problems with some definitions used in complexity theory, but "size of input" is certainly not part of the problem. It can be defined very precisely. I don't see the slightest problem with how it's framed.
- dooglius 5y agoSo what is N here? The sequence length, number of digits across all sequence elements, sum of all elements?
- deleted 5y ago[deleted]
- qsort 5y agoN is the sum of the lengths of the elements of all lists, when all elements are written in binary (or any other base, which is the same up to a constant).