@Teja: The complexity of your code is O(quotient). Code has been
presented that is O(log(quotient)).
Dave
On Aug 23, 8:47 am, teja bala <pawanjalsa.t...@gmail.com> wrote:
> //works only for ints
> #include<stdio.h>
> int div(int a,int b);
> main()
> {
> int q,w,x;
> scanf("%d %d",&q,&w);
> x=div(q,w);
> printf("%d",x);
> }
> int div(int x,int y)
> {
> int z=x,count=0;
> while(z>=y)
> {
> z-=y;
> count++;}
>
> return count;
> }
--
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 at
http://groups.google.com/group/algogeeks?hl=en.
