@ankush, I think the worst case time complexity will be [ (M+N) * L ] this is beacuse, in the worst case all the 2-d arrays can probably contain the element. Now searching the single 2-D array needs O ( M+N ) But since there can be L such 2-D arrays in the worst case, Wors case TC- O[ (M+N) * L ]
-- 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/-/4Iwl3b_WikMJ. 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.
