Force won't work
>
> On Sun, Jul 3, 2011 at 1:17 PM, rajeevrvis wrote:
>
>
>
>
>
>
>
>
>
> > Hi Here is the code . I want to optimize it to run faster .
> > Can Anyone help me???
>
> > #include
> > void main()
> > {
> >
Hi Here is the code . I want to optimize it to run faster .
Can Anyone help me???
#include
void main()
{
int n,q,a[10]={0},b[10],c[10],d[10],i,count,j;
scanf("%d%d",&n,&q);
for(i=0;ihttp://groups.google.com/group/algogeeks?hl=en.
Are there any Algorithms for finding efficient max differences ?
On Jul 1, 11:42 pm, Hemanth 007 wrote:
> Hii,
> One improvement is that finding min and max can be done in a single
> run, rather than calling the findMin and findMax separately.
> But yet the order is O(n);
> Is there any better
