2012/1/2 vivek dhiman <[email protected]>: > What is the fastest way to parse a string of length N with a complexity < > N/2
Is it me or is that thread going mad? Of course you can't, you need at least O(N) time to read N memory blocks (one byte in you case) and O(1) to iterate over those blocks. But you knew it, i'm sure :) -- Jérémie MARGUERIE -- You received this message because you are subscribed to the Google Groups "Google Code Jam" group. To post to this group, send email to [email protected]. To unsubscribe from this group, send email to [email protected]. For more options, visit this group at http://groups.google.com/group/google-code?hl=en.
