cyclomatic-complexity

Suppose there is the following code: private static int DoSwitch(string arg) { switch (arg) { case "a": return 0; case "b": return 1; case "c": return 2; case "d": return 3; } return -1; } private static Dictionary<string, Func<int>> dict = new Dictionary<string, Func<int>> { {"a", () => 0 }, {"b", () => 1 }, {"c", () => 2 }, {"d", () => 3 }, }; private static int DoDictionary(string arg) { return dict[arg](); } By iterating over both methods and comparing, I am getting that the dictionary is slightly faster, even when "a", "b", "c", "d" is expanded to include more keys. Why is this so? Does

After reading " What’s your/a good limit for cyclomatic complexity? ", I realize many of my colleagues were quite annoyed with this new QA policy on our project: no more 10 cyclomatic complexity per function. Meaning: no more than 10 'if', 'else', 'try', 'catch' and other code workflow branching statement. Right. As I explained in ' Do you test private method? ', such a policy has many good side-effects. But: At the beginning of our (200 people - 7 years long) project, we were happily logging (and no, we can not easily delegate that to some kind of ' Aspect-oriented programming ' approach for