Re: [algogeeks] optimisation

strassen multiplication , but it may cause overflow On Tue, Feb 28, 2012 at 5:27 AM, Arun Vishwanathan wrote: > Hi all, > > We have this challenge to make the fastest executing serial matrix > multiplication code. I have tried using matrix transpose( in C for row > major ) and loop unrolling.I wa

[algogeeks] optimisation

Hi all, We have this challenge to make the fastest executing serial matrix multiplication code. I have tried using matrix transpose( in C for row major ) and loop unrolling.I was able to obtain little speedup. Does anyone have any hints/papers that I could read upon and try to speed up further?I h

Re: [algogeeks] Optimisation to reduce time...

You should have posted the problem link i think u are trying this one. use RMQ or Binary Indexed Trees. Brute Force won't work On Sun, Jul 3, 2011 at 1:17 PM, rajeevrvis wrote: > Hi Here is the code . I want t

Re: [algogeeks] Optimisation to reduce time...

Can you give an insight to what exactly this code does? That may help quiet a lot. Regards, Sandeep Jain 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() > { > int n,q,a[1

[algogeeks] Optimisation to reduce time...

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.