Reputation
2,888
Next privilege 3,000 Rep.
Cast close & reopen votes
Badges
1 14 19
Impact
~352k people reached

  • 0 posts edited
  • 0 helpful flags
  • 299 votes cast
Nov
11
awarded  Famous Question
Oct
27
awarded  Yearling
Oct
27
awarded  Yearling
Oct
27
awarded  Yearling
Oct
16
awarded  Pundit
Sep
17
awarded  Nice Answer
Sep
1
awarded  Favorite Question
May
29
awarded  Nice Answer
Jan
1
awarded  Notable Question
Dec
1
answered algorithm for project euler problem no 18
Oct
27
awarded  Yearling
Sep
7
comment How can I convince my boss that ANSI C is inadequate for our new project?
@OlegV.Volkov "Real-time" does not necessarily mean "fast" (e.g., sub-milisecond latencies). Since it's running on non-RTOS, it doesn't matter whether it's C or C#, if it's fast enough.
Sep
6
comment Is Oberon really “a better Pascal”?
Can EXIT escape multi-level loops? If not, omitting GOTO was a bad decision.
Aug
2
revised How have languages influenced CPU design?
added 36 characters in body
Aug
2
awarded  Notable Question
Aug
1
answered How have languages influenced CPU design?
Jul
19
comment Materials on structural languages design?
@mouviciel Yes, it would most probably still use a struct in order to preserve source-compatibility.
Jul
4
answered Which algorithms/data structures should I “recognize” and know by name?
Jun
25
comment Is it any good to use binary arithmetic in a C++ code like “C style”?
@zxcdw The myth of asymptotic running time and "big inputs". O(n^2) algorithm may have low enough constant that it is faster than the best known O(n log n) if I know that my particular problem instance is limited to, say, n < 100. FWIW, I have managed to implement a quick sort that significantly outperforms std::sort on a large vector (whole contents of "Ana Karenina") of strings.
Jun
25
comment Is it any good to use binary arithmetic in a C++ code like “C style”?
Yes, (mostly) rubbish. Some algorithms and data structures (radix sort, tries, etc.) are efficient because they exploit binary representation.