End Google Ads 201810 - BS.net 01 --> Assuming I have a string of numbers beginning with "6" (i.e., "612345"). I wish to check if the numbers 6, 2, and 4 appear in that order. Thus, I can check for "6[0-9]*2[0-9]*4" using regular expressions. However, knowing that the numbers I'm checking have to begin with a 6, does it actually save me time to only search for "2[0-9]*4"? The reason I ask is because logically, using the first search, "6" would be found in the first character and "2" would start from the second character. However, using the second search, "2" would start from the first character which I already know to be a "6". In the first case, I get code readability, while in the second, I'm only searching for what the minimum is needed. I'm wondering if there is any optimization technique that could possibly make the first method run faster than the second?

Thanks!