Reputation
6,334
Top tag
Next privilege 10,000 Rep.
Access moderator tools
Badges
13 51
Newest
 Nice Answer
Impact
~265k people reached

Apr
28
answered List comparing techniques for faster performance
Apr
28
comment List comparing techniques for faster performance
50k and 400k aren't particularly big lists. two foreach cycles or Linq this will get you O(n^2) time complexity and yes that is a slow approach.
Apr
24
comment Is String processing more complex than number processing in programming languages?
In most programming languages strings are a layer of abstraction on top of numbers. So when you're processing strings, under the hood the computer translates it to numbers and processes numbers.
Apr
23
comment Using JOIN keyword or not
@RemcoGerlich why it has been deprecated isn't under discussion here. What's under discussion here is whether to use the old or new syntax. Whether one is better then the other or not is moot: you shouldn't use old syntax. The why question is another discussion. (one that has been settled 20 years ago.)
Apr
23
answered Using JOIN keyword or not
Apr
23
comment Using JOIN keyword or not
I also tend toward that style to minimize surprise I think you just answered your own question. Surprises are bad.
Apr
21
awarded  Nice Answer
Apr
21
answered Does using a database server make sense if the application only does things locally?
Apr
20
answered Big O Question about an algorithm with (n^2 + n) / 2 growth rate
Apr
16
comment Entire webpage obfuscation
If you need to obfuscate your php you are doing it wrong.
Apr
6
awarded  Yearling
Apr
1
answered How often is software speed evident in the eyes of customers?
Apr
1
comment How often is software speed evident in the eyes of customers?
@BenL on the other hand I experienced the opposite, some operation that was slow before we made fast, so fast that users thought the action either hadn't executed or failed.
Mar
31
comment Check distance between all elements in a list of numbers in O(n*lg(n))
The check_duplicate is not needed. And your code will break on 1 set element. Also what about negative k ?
Mar
12
comment How to budget for a programmer you're not ready to hire yet?
Sorry, I can only comment with an xkcd xkcd.com/1425
Mar
11
comment How can I avoid these nested repetitive ifs?
I think you should refactor it and not have status and host together.
Mar
4
answered Addition or deletion of elements of a dynamic array
Feb
27
comment How to work with a messy codebase and client
You offered to redo the site, no extra charge, he refused. This. Now you can drop the project, refund him and have no need to feel bad at all.
Feb
26
comment The recommended Way to exit a Loop
In reaction to your edit: you can still wrap the buffer-reader in a function and provide "line" as an argument to that function. No need for globals : RetunSuccessOnBufferedLineRead(line)
Feb
26
comment SQL - Algorithm for finding availability of a resource
Convert your time-ranges to time-slots and your problem becomes a lot easier to solve.