@ll...thnx a lot On Sat, Aug 25, 2012 at 8:22 PM, GAURAV CHAWLA <[email protected]>wrote:
> see.... A(n)ie the average case will always be smaller or equal to the > worst case... > > ie something like... A(n)<= c. w(n) for some c as constt ... which the > definition of big O... > > correct me if i'm wrong.. > > On Sat, Aug 25, 2012 at 7:11 PM, rahul sharma <[email protected]>wrote: > >> *Let w(n) and A(n) denote respectively, the worst case and average case >> running time of an algorithm executed on an input of size n. which of the >> following is ALWAYS TRUE?* >> (A) [image: A(n) = \Omega(W(n))] >> (B) [image: A(n) = \Theta(W(n))] >> (C) [image: A(n) = O(W(n))] >> (D) [image: A(n) = o(W(n))] >> >> answer is c >> >> plz explain y??? >> >> -- >> 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, > GAURAV CHAWLA > +919992635751 > +919654127192 > > > > > > -- > 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.
