Re:The "C is Efficient" Language Fallacy (2006)
by cperciva on Monday January 09, 2012 @02:07PM
(#3443782)
Indeed, finding all LCSs requires exponential time: The strings "abcdefghijkl..." and "badcfehgjilk..." have the 2^(N/2) LCSs "[ab][cd][ef][gh][ij][kl]..." and no algorithm can ever run faster than the amount of time it takes to print its output.
[ Parent
| on HN ]
There are no comments on this comment yet.