6,453 reputation
32045
bio website earlz.net
location Cleveland, OH
age 23
visits member for 3 years, 10 months
seen Jun 8 at 1:40

Hello there! My name's Jordan Earls and I'm a programmer. Recently, I've been doing almost exclusively work in .Net with C#, a bit of raw IL, and in some cases a hefty serving of code generating T4(it's the meta-future!). Sometimes I do a bit of embedded/electronic work with C and C++(http://mbed.org rocks, btw). And finally, I have at least some competence in Ruby, Delphi, and Javascript.

I currently work for PreEmptive Solutions on the Dotfuscator team and troll the dotfuscator tag on occasion.

Most of my personal projects are open source and BSD licensed. The majority of them are at bitbucket with the rest of them being listed on github

Also, you can follow me on the twitters @earlzdotnet


Aug
5
accepted What are some good ways to get familiar with .Net's IL?
Aug
3
comment What are some good ways to get familiar with .Net's IL?
@ElYusubov I know how to accept an answer :P
Jul
30
comment What are some good ways to get familiar with .Net's IL?
Good point @SK-logic (assuming you "REALLY" want to get to know it. The other only other option I can think of is implement an emulator, but that would be harder than usual with .Net)
Jul
28
answered Pros and Cons of holding all the business logic in stored procedures in web application
Jul
28
asked What are some good ways to get familiar with .Net's IL?
Jul
26
awarded  Popular Question
Jul
5
accepted Which algorithms/data structures should I “recognize” and know by name?
Jul
5
comment Which algorithms/data structures should I “recognize” and know by name?
@JamesYoungman good point there, but that wasn't included as part of the problem. I asked the same thing to the interviewer and he said assume it's a flat fee
Jul
5
comment Which algorithms/data structures should I “recognize” and know by name?
Also, I have a lot of studying to do :)
Jul
5
comment Which algorithms/data structures should I “recognize” and know by name?
Good point about the locker problem. The only thing is that wouldn't a queue still be faster if random access wasn't required? (A customer says "I need a locker" not "I need locker #123") I'm unsure of what you'd say the complexity is for adding and removing from a queue. Probably O(n)?
Jul
5
awarded  Nice Question
Jul
4
comment Which algorithms/data structures should I “recognize” and know by name?
@Telastyn Random access isn't needed though. A person will get a locker out of the free list, and a person will return a locker to the free list. That's it. If you want to discuss further we can carry this onto chat
Jul
4
comment Which algorithms/data structures should I “recognize” and know by name?
@Telastyn So you're suggesting an array? How will you remove a locker from the free list or add one back. This was an Amazon interview question and I thought an array at first as well and we ended up at queue/stack as being the most efficient. Of course, a linked-list could be used too, but I think all three will perform the same
Jul
4
comment Which algorithms/data structures should I “recognize” and know by name?
@Oded How exactly should I rephrase it to not be subjective?
Jul
4
asked Which algorithms/data structures should I “recognize” and know by name?
May
29
awarded  Stellar Question
May
29
awarded  Great Question
May
29
awarded  Famous Question
May
26
revised Which hashing algorithm is best for uniqueness and speed?
minor wording change
May
25
awarded  Notable Question