title: Switch optimization for many cases guarantees equal access time for any case? ( C++ )
body: <p>I've seen answers here for specific languages, about switches with more than 5 cases being optimized with jump tables to guarantee constant access time for any case.<br>
  Is that so for C / C++?<br>
  Is it in particular for gcc? for visual studio?<br>
  If not, would sorting cases in order of occurrence frequency help?</p>