hello look the best case of circular queue is 0(1) and worst case is 0(n) so avg. case should be between these two so if n+1/2 is avg case then also avg. case will be then 0(n).
plz check it and may be i am wrong bye On 12/16/06, programming <[EMAIL PROTECTED]> wrote: > > > > programming wrote: > > Thanks for the advice, i think i am right about the circular queue been > > a(n)=n+1/2, you agree? > > Is this also the average case for a tree of degree(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 [EMAIL PROTECTED] For more options, visit this group at http://groups-beta.google.com/group/algogeeks -~----------~----~----~----~------~----~------~--~---
