first loop n
send loop n^2
third loop n(i m not sure)
so n^4
Thank you,
Sid.
On Sat, Sep 10, 2011 at 11:09 AM, ravi maggon wrote:
> I think it should be n^3
>
>
> On Sat, Sep 10, 2011 at 10:51 AM, Neha Singh
> wrote:
>
>> O(n^5)
>>
>> --
>> You received this message because you are subscribe
I think it should be n^3
On Sat, Sep 10, 2011 at 10:51 AM, Neha Singh wrote:
> O(n^5)
>
> --
> 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,
O(n^5)
--
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
What is the complexity of this code
for(i=0;ihttp://groups.google.com/group/algogeeks?hl=en.
