Well, "technically", if you have to initialize O(N^2) space with *any* value, then your algo is O(N^2). In practice, memset is pretty fast, however, that just reduces the constant factor - it will not (eventually) beat an O(N) algo. BTW, my solution is O(N).
-- DK http://twitter.com/divyekapoor http://www.divye.in -- You received this message because you are subscribed to the Google Groups "Algorithm Geeks" group. To view this discussion on the web visit https://groups.google.com/d/msg/algogeeks/-/XnCZNAePQokJ. To post to this group, send email to algogeeks@googlegroups.com. To unsubscribe from this group, send email to algogeeks+unsubscr...@googlegroups.com. For more options, visit this group at http://groups.google.com/group/algogeeks?hl=en.
