@ Dave
can u explain ur answer.......plz..
On Thu, Sep 23, 2010 at 8:55 AM, Dave <dave_and_da...@juno.com> wrote:
> @Krunal: N = n * ceiling(log_2(n)) - 2^ceiling(log_2(n)) + 1,
>
> where a^b is a to the power b.
>
> Dave
>
> On Sep 23, 8:19 am, Krunal Modi <krunalam...@gmail.com> wrote:
> > for(k=1 ; k<n ; k++){
> > j=k;
> > while(j>0){
> > j=j/2;
> > }
> >
> > }
> >
> > How many times while loop gets executed (for any n) ?
> >
> > I don't want answer in terms of series (i.e, don't want any sigma, I
> > have that)
>
> --
> You received this message because you are subscribed to the Google Groups
> "Algorithm Geeks" group.
> To post to this group, send email to algoge...@googlegroups.com.
> To unsubscribe from this group, send email to
> algogeeks+unsubscr...@googlegroups.com<algogeeks%2bunsubscr...@googlegroups.com>
> .
> 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 algoge...@googlegroups.com.
To unsubscribe from this group, send email to
algogeeks+unsubscr...@googlegroups.com.
For more options, visit this group at
http://groups.google.com/group/algogeeks?hl=en.
