The algorithm checks whether the actual character in the text matches the give character in the pattern.  So, let’s see the concrete illustration how brute-force substring search works. It is working fine and it is quite easy to implement this approach but there is a huge issue. The algorithms keeps comparing way too many characters