If vs. Switch Speed

by

The compiler can build jump tables where applicable. For example, when you use the reflector to look at the code produced, you will see that for huge switches on strings, the compiler will actually generate code that uses a hash table to dispatch these. The hash table uses the strings as keys and delegates to the case codes as values.

This has asymptotic better runtime than lots of chained if tests and is actually faster even for relatively few strings.

More Related Contents:

  1. Is “else if” faster than “switch() case”? [duplicate]
  2. C# – Which is the best alternative to ‘switch on type’? [duplicate]
  3. Is the conditional operator slow?
  4. c# home works can’t solve [closed]
  5. Is a LINQ statement faster than a ‘foreach’ loop?
  6. C# switch statement limitations – why?
  7. Do try/catch blocks hurt performance when exceptions are not thrown?
  8. Multiple cases in switch statement
  9. Excel Interop – Efficiency and performance
  10. Is there any benefit to this switch / pattern matching idea?
  11. C# switch on type [duplicate]
  12. Is there a performance impact when calling ToList()?
  13. Why switch for enum accepts implicit conversion to 0 but no for any other integer?
  14. Is ‘switch’ faster than ‘if’?
  15. Performance Tests of Serializations used by WCF Bindings
  16. Performance of calling delegates vs methods
  17. HttpWebRequest is extremely slow!
  18. c# – Volatile keyword usage vs lock
  19. Efficient Cartesian Product algorithm
  20. Static vs. non-static method
  21. Is there any performance difference between ++i and i++ in C#?
  22. C# quickest way to shift array
  23. System.Net.WebClient unreasonably slow
  24. How much faster is C++ than C#?
  25. Console.WriteLine slow
  26. How do I measure how long a function is running?
  27. How to read last “n” lines of log file [duplicate]
  28. Winforms: SuspendLayout/ResumeLayout is not enough?
  29. Heap versus Stack allocation implications (.NET)
  30. C# Dynamic Keyword — Run-time penalty?

Leave a Comment