Reputation
353
Top tag
Next privilege 500 Rep.
Access review queues
Badges
2 7
Newest
 Good Answer
Impact
~6k people reached

Oct
9
awarded  Good Answer
Feb
12
comment Problems Calculating Big-O Complexity
@SChepurin: "O(n/2)" is really O(n). As others have said, as long as the data structure is an array and not a linked list or something, and these are accurately transcribed, both of these functions are O(n).
Oct
5
awarded  Editor
Oct
5
revised What is a “Process Canary”
fixing spelling, case and linkifying
Oct
5
suggested approved edit on What is a “Process Canary”
Sep
17
awarded  Yearling
Jul
7
awarded  Supporter
Jul
6
awarded  Critic
Jul
5
awarded  Mortarboard
Jul
5
awarded  Nice Answer
Jul
5
awarded  Teacher
Jul
5
answered Clean readable code vs fast hard to read code. When to cross the line?
Sep
16
awarded  Autobiographer