4,853 reputation
22146
bio website
location
age
visits member for 4 years
seen Sep 16 '13 at 22:05

no blog, no github yet.


Sep
9
awarded  Yearling
Apr
22
awarded  Notable Question
Mar
9
awarded  Popular Question
Mar
2
awarded  Popular Question
Feb
16
awarded  Nice Question
Dec
16
awarded  Notable Question
Nov
21
awarded  Popular Question
Sep
9
awarded  Yearling
Aug
16
comment How can programmers improve their UX skills?
Some people naturally care about simple UI; others could care less and do not want to waste their time.
Aug
16
comment How to migrate my thinking from C++ to C#
#1 is a hard one for me, would like to know the answer myself. #2 - could you give a simple C++ code example and explain why you need that? For #3 - use C# to generate other code. You can read a CSV or an XML or what have you file as an input and generate a C# or an SQL file. This can be more powerful than using functional macros.
Aug
16
comment How to figure out design pattern for this particular solution?
The stated design is synthetic and therefore is useless to me. I want to help, but I can only solve real problems. What is the actual and not hypothetical problem that you are trying to solve? Something that a customer is paying you to figure out or something you need for a real life hobby project - what is it?
Aug
7
comment Abstract class + Inheritance vs Interface
One thing that is really cool about interfaces is that methods can accept them as parameter types. I do not have a great example, but it is very powerful. You can accept an IEnumerable interface type for a parameter and not have to care about the particular implementation. You cannot achieve the same with a class hierarchy - you will end up dragging a much bigger view into an object (if you will) than you actually need.
Aug
5
comment Trying to understand the 2N lnN compares for quicksort
Part of the answer, copied from en.wikipedia.org/wiki/Quicksort "So, averaging over all possible splits and noting that the number of comparisons for the partition is n - 1, the average number of comparisons over all permutations of the input sequence can be estimated accurately by solving the recurrence relation:" For some reason we are off by 2 here - n-1 vs n+1.
Aug
5
comment Why is an anemic domain model considered bad in C#/OOP, but very important in F#/FP?
"Note: I'm specifically interested in the differences in C#/F# that could change the opinion of what is good/bad" - whose opinion? Note that you used the word "opinion". Do you suffer from being a conformist? Then stop. You are not obligated to write a bunch of oop code in order to use C#. You could use structs when all you need is data, but you must be careful with structs as they get copied by value, and other stuff. Sometimes all you need is a bunch of stateless functions. You have to create a class to encapsulate them, though not in VB.Net. This is just a restriction of the C# language.
Jul
25
awarded  Good Answer
Jun
16
awarded  Good Answer
Jun
13
comment Which design patterns would I use for this algorithm?
Design patterns are often overused, and in this case you definitely do not need one. Just split things into small functions, keep single responsibility principle in mind.
Jun
11
comment Inheritance using non-abstract base class
Perhaps this is a question that is data/statistics-based in nature? It would be cool if I could run some sort of oop complexity tool on a library and then have it propose an alternative design and run another type of complexity evaluation tool and then tell you the two scores? The UI widget class hierarchy does make a lot of sense. One should be able to prove so statistically somehow, with the help of algorithms that analyze ASTs. There are some other libraries that also use a lot of inheritance whereas they should not. I wish there was a tool that could measure just how bad things are.
May
28
comment How can degree of order in a list be measured?
Why do you ask for this? Are you trying to produce something random that also "looks random"? Be careful, fo randomness does not look random. I would not test an individual list to see if it is random enough. I would test the shuffling algorithm by examining thousands of outcomes.
May
15
comment Examples of general purpose algorithms that have benefited from running on a GPU?
String concatenation, sleep sort