Update DialogBinaryString.cpp

[KulikAlex]

I don't think this code would benefit from using an algorithm with linear time complexity in any real-life scenario.

This will work faster if you search for a 10kb substring in a 100mb string. It will be about seven seconds to zero. I tested this in my kmp branch