Guys ! If the i=n is a printing error, then its Ok. But if its not, shouldn't an assignment statement evaluate to a TRUE every time and the construct goes into an infinite loop. Am i going wrong somewhere ?
On Aug 6, 10:13 pm, "pacific :-)" <[email protected]> wrote: > 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 > <[email protected]>wrote: > > > > > > > > > > > what is *Page segmentation?* > > Thank you, > > Siddharam > > > On Sat, Aug 6, 2011 at 10:35 PM, ankit sambyal > > <[email protected]>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 [email protected]. > >> To unsubscribe from this group, send email to > >> [email protected]. > >> 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 [email protected]. > > To unsubscribe from this group, send email to > > [email protected]. > > 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 [email protected]. To unsubscribe from this group, send email to [email protected]. For more options, visit this group at http://groups.google.com/group/algogeeks?hl=en.
