I believe the answer for fifth one is o(n2) , f(1) + f(2) + ... + f(n/2) ( increment the counter alternatively). Im not very sure.
On Sat, Aug 6, 2011 at 10:39 PM, siddharam suresh <siddharam....@gmail.com>wrote: > what is *Page segmentation?* > Thank you, > Siddharam > > > > On Sat, Aug 6, 2011 at 10:35 PM, ankit sambyal <ankitsamb...@gmail.com>wrote: > >> @neha: Cud u explain how r u getting d option for ques 4 ?? >> >> -- >> 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. > -- regards, chinna. -- 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.
