Reputation
10,370
Top tag
Next privilege 15,000 Rep.
Protect questions
Badges
1 23 46
Newest
 Nice Answer
Impact
~596k people reached

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
May
5
answered When designing a replacement application, how can I compare its performance to the original, if there are no existing statistics?
Apr
28
comment List comparing techniques for faster performance
+1 @cap7: This is what I would do - sort both lists and use a merge loop. You're not clearing the lists, just indexing through them.
Mar
26
comment Does code generation increase the code quality?
@gbjbaanb: I agree. That's why I said enough flexibility. To me, the issue is not the code generator itself, but the domain-specific-language that serves as its input. If that DSL is too flexible, the user has to swim around in options. If it is not specific enough, the user has to work around its limitations. I can give examples of these.
Mar
17
comment Writing Z80 table based assembler/disassembler
Unless you are running this on a tiny machine, you don't really need to worry about storage size of the table.