Quote:

Originally Posted by **oogabooga**
T

In point 4 I assume you meant "power", not "multiple", of 2. I can't imagine anyone using pow to calculate powers of 2, but clearly bitshifting is much faster.

>> It's not like that. People forgot to use. Because many calculations based on power on doubles, there using pow function If in these between power of 2 is required, then normally people forgot to use bit shift.

So just it's care .>>>>

Quote:

Originally Posted by **oogabooga**
T

Point 5 is hideously incorrect! The most important aspect of program speed is size (of program and especially data). If more can fit into the CPU cache, it will run faster. Besides, array offsets are calculated using multiplication, not powers.

>>>Offcourse man If you will fijt more data at a time into catch it will be fast. But why you are raising this point here. No logic to raise this idea here.

You point is in my post: Fast Algorithm for matrix multiplication: Block Algorithm