You are given a stack of punched cards, each with m rows and n columns. Come up with a algorithm to punch holes so that you can find the missing cards (their sequences) in O(1) time. You can assume that you are looking for a missing card and only one is missing out of all possibilities.
i din understood the question :-O -- With Regards, Jalaj Jaiswal +919026283397 B.TECH IT IIIT ALLAHABAD -- You received this message because you are subscribed to the Google Groups "Algorithm Geeks" group. To post to this group, send email to algoge...@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.
