Reputation
10,168
Top tag
Next privilege 15,000 Rep.
Protect questions
Badges
1 23 43
Newest
 Yearling
Impact
~578k people reached

Oct
5
answered Finite Element Shader
Sep
30
revised When is optimization not premature and therefore not evil?
added 370 characters in body
Sep
30
answered When is optimization not premature and therefore not evil?
Sep
29
comment Performance concern in object oriented languages
Performance problems are never where you think they are. I only know of one absolutely sure-fire can't-miss way to find them, and that is to use a small number of random stack samples. I work in a large C# project, and it has found some large speedups. The point is, assuming there is a real performance problem, no matter what it is, fixing it will save some fraction of time, like from 10% to 90%. The probability you will catch it in the very act on any single sample is at least that large. (It is extremely unlikely to be what you're guessing.)
Sep
17
awarded  Yearling
Sep
9
comment What is O(m+n) and O(m*n) in Big O notation?
@MetaFight: yippee
Sep
8
comment What is O(m+n) and O(m*n) in Big O notation?
@MetaFight: now it does.
Sep
8
revised What is O(m+n) and O(m*n) in Big O notation?
added 52 characters in body
Sep
7
answered What is O(m+n) and O(m*n) in Big O notation?
Sep
4
revised Class design, responsibility granulation, efficiency and performance
added 406 characters in body
Sep
4
answered Class design, responsibility granulation, efficiency and performance
Aug
29
answered Linking two or more different programming languages
Aug
5
awarded  Good Answer
Jun
23
comment What is the best aproach for coding in a slow compilation environment
@John: Yeah, a well-written compiler should (IMHO) be I/O bound.
Jun
22
comment How to find bottlenecks in an application?
@ChocoDeveloper: Revisiting this 2 years later. It's like interviewing 10 candidates for a job, versus 1000. With the small number you're going to pay close attention to each one. With the large number you're going to skim, missing important details. That's the trouble with most profilers - it's not the taking of samples, it's the conversion to numbers.
May
15
awarded  Nice Answer
May
8
comment How does modulus work?
To answer your question, there is an integer division instruction, which produces both a quotient and a remainder, and the modulus is just the remainder. But pay attention to @uesp comment. The division takes around 1e-9 seconds, even if the compiler hasn't precalculated it (which in this case it has). The cout << takes around 1e-3 seconds, so this is like trying to weigh a hair by weighing the Bison who owns it.
May
5
revised When designing a replacement application, how can I compare its performance to the original, if there are no existing statistics?
added 286 characters in body
May
5
revised When designing a replacement application, how can I compare its performance to the original, if there are no existing statistics?
added 252 characters in body
May
5
revised When designing a replacement application, how can I compare its performance to the original, if there are no existing statistics?
added 73 characters in body