No,O(N^2) because all the flips happens simultaneously, it can be reduce to O(2N) if each tile is represented using a single bit
On Fri, Nov 4, 2011 at 11:12 PM, Dumanshu <duman...@gmail.com> wrote: > is ur brute force O(1) for space? > > On Nov 4, 10:24 am, sunny agrawal <sunny816.i...@gmail.com> wrote: >> What can be a better solution than a Brute Force O(N^2* No of iteration) >> >> -- >> Sunny Aggrawal >> B.Tech. V year,CSI >> Indian Institute Of Technology,Roorkee >> >> fb1_input.txt >> < 1KViewDownload >> >> facebook.jpg >> 119KViewDownload >> >> fb1_output.txt >> < 1KViewDownload > > -- > 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. > > -- Sunny Aggrawal B.Tech. V year,CSI Indian Institute Of Technology,Roorkee -- 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.
