Hi everyone, I am writing a function to multiply two matrices together. Does anyone know if it would be faster to use the '*' operator or the '&' operator?
Hi everyone, I am writing a function to multiply two matrices together. Does anyone know if it would be faster to use the '*' operator or the '&' operator?
I go to encounter for the millionth time the reality of experience and to forge in the smithy of my soul the uncreated conscience of my race.
Windows XP consists of 32 bit extensions and a graphical shell for a 16 bit patch to an 8 bit operating system originally coded for a 4 bit microprocessor, written by a 2 bit company, that can't stand 1 bit of competition.
>>Does anyone know if it would be faster to use the '*' operator or the '&' operator?
* and & are overloaded operators, do you mean multiplication and bitwise AND or dereference and address-of? If it's the first one then either one because even though the bitwise operators are usually faster, most compilers will optimize the difference and it's better to make more sense than go for a little more speed. If it's the second then Edward has no idea what you mean.
=Ed=
Thanks for your help, Edward The first was correct
I go to encounter for the millionth time the reality of experience and to forge in the smithy of my soul the uncreated conscience of my race.
Windows XP consists of 32 bit extensions and a graphical shell for a 16 bit patch to an 8 bit operating system originally coded for a 4 bit microprocessor, written by a 2 bit company, that can't stand 1 bit of competition.