Why are C# compiled regular expressions faster than equivalent string methods?

Question

Every time I have to do simple containment or replacement operations on strings, where the term that I\'m searching for is a fixed value, I find that if I take my sample input a