i think kmp in 2-D can help. On Fri, Apr 8, 2011 at 10:33 PM, RIDER <mohit...@gmail.com> wrote:
> if there is a matrix A[][] of order m and another matrix B[][] of > order n such that (m>n) you have to find the occurance of matrix B[][] > in matrix A[][]. > > A[5][5]=1,2,3,4,5 > 5,4,1,9,7 > 2,1,7,3,4 > 6,4,8,2,7 > 0,2,4,5,8 > > B[3][3]=1,9,7 > 7,3,4 > 8,2,7 > > -- > You received this message because you are subscribed to the Google Groups > "Algorithm Geeks" group. > 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. > > -- You received this message because you are subscribed to the Google Groups "Algorithm Geeks" group. 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.
