Courageous said:In strict complexity theory, the O() notation that you are invoking ala abracadabra is to express the upper bounds of the compute algorithm.
Sig-worthy
Anyway, there's a nice article about undocumented features of strings over at CodeProject, especially the part called 'Efficient String Switches' in the middle of the page.
Strings UNDOCUMENTED.