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
I wonder the average case here means the average successful searching
case or average unsuccessful searching case or the total average
searching case?
--~--~-~--~~~---~--~~
You received this message because you are subscribed to the Google Groups
"Algorithm Gee
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
Thanks for the advice, i think i am right about the circular queue been
a(n)=n+1/2, you agree?
--~--~-~--~~~---~--~~
You received this message because you are subscribed to the Google Groups
"Algorithm Geeks" group.
To post to this group, send email to algogeeks
1.)
If you're talking about search using a tree with each node having degree 4, then
the best-case complexity is indeed O(1). Why, the first node (the
root) could be the one that you're looking for.
3.)
Yes indeed. Since, your tree doesn't seem to have any branching logic
(like a BST does), the c
