Re: [algogeeks] Re: Disjoint Set data structure
sorry, replied on wrong thread. :p On Sun, Feb 5, 2012 at 11:42 PM, chirag ahuja wrote: > Shashank is right, if someone is in the need of some book, why do some > people here feel the need to post things like "this is not a place for file > sharing and crap.." You can just ignore the mail, and let the person who > needs the book take help from others who are willing to help. > > > On Sun, Feb 5, 2012 at 11:33 PM, WgpShashank > wrote: > >> @Karthik ..You Can Look >> http://en.wikipedia.org/wiki/Ackermann_function#Inverse >> >> >> *Thanks >> Shashank Mani Narayan >> Computer Science & Engineering >> Birla Institute of Technology,Mesra >> ** Founder Cracking The Code Lab "http://shashank7s.blogspot.com/"* >> >> -- >> 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/-/jGHAVoQJ4SsJ. >> >> 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.
Re: [algogeeks] nyone having pointer in c ebook..plz mail me...
Shashank is right, if someone is in the need of some book, why do some people here feel the need to post things like "this is not a place for file sharing and crap.." You can just ignore the mail, and let the person who needs the book take help from others who are willing to help. On Sun, Feb 5, 2012 at 11:15 PM, WgpShashank wrote: > @Saurabh People Can Ask for Free Materials until it violates copyright law > , if someone has they can help each other through personal mail, there is > nothing wrong in this . > > > > *Thanks > Shashank Mani Narayan > Computer Science & Engineering > Birla Institute of Technology,Mesra > ** Founder Cracking The Code Lab "http://shashank7s.blogspot.com/"* > > -- > 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/-/_zZWqnR--hIJ. > > 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.
Re: [algogeeks] Re: Disjoint Set data structure
Shashank is right, if someone is in the need of some book, why do some people here feel the need to post things like "this is not a place for file sharing and crap.." You can just ignore the mail, and let the person who needs the book take help from others who are willing to help. On Sun, Feb 5, 2012 at 11:33 PM, WgpShashank wrote: > @Karthik ..You Can Look > http://en.wikipedia.org/wiki/Ackermann_function#Inverse > > > *Thanks > Shashank Mani Narayan > Computer Science & Engineering > Birla Institute of Technology,Mesra > ** Founder Cracking The Code Lab "http://shashank7s.blogspot.com/"* > > -- > 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/-/jGHAVoQJ4SsJ. > > 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.
Re: [algogeeks] Please Mention Your Info. Name/Collage/Country and Reason for Joining Algogeek to Minimize Spamming
This is insane!!! You, whatever is your name, are spamming by posting such idiotic things! On Mon, Oct 17, 2011 at 2:47 PM, WgpShashank wrote: > Hey Guys , to Minimize Spamming & Maintaining Quality of Group we Need > Support from You. Please Mind Above Message. > > > > > > > > Happy Learning :) > Thanks > Team Algogeek > > -- > 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/-/HRTpd-Y_MV4J. > 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.
[algogeeks] Google Question
Given an array of size n wherein elements keep on increasing monotonically upto a certain location after which they keep on decreasing monotonically, then again keep on increasing, then decreasing again and so on. Sort the array in O(n) and O(1). I didn't understand the question, any array of n elements will be like this except when first there is a decrese from index 0 to a higher index. Any ideas about how to solve it in given constraints?? -- 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.
[algogeeks] Amazon
Given a dictionary of millions of words, write a program to find the largest possible rectangle of letters such that every row forms a word (reading left to right) and every column forms a word (reading top to bottom). Anyone got any ideas? ... -- 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.
