Does .Net 4 (or any prior version) perform any sort of optimization on longer switch statements based on strings?
I'm working around a potential performance bottleneck due to some long switch statements looking for matching strings in the cases, and I've always assumed these are searched in linear time (or near linear, i.e. not using an index to quickly find the matching string). But this seems like an obvious area that .Net could optimize, so thought I'd check if this is the case or not.
This is a derivative question from my recent one: indexed switch statement, or equivalent? .net, C#