▁than ▁checking ▁every ▁character ▁of ▁the ▁text . ▁The ▁reason ▁that ▁this ▁works ▁is ▁that ▁in ▁l ining ▁up ▁the ▁pattern ▁against ▁the ▁text , ▁the ▁last ▁character ▁of ▁the ▁pattern ▁is ▁compared ▁to ▁the ▁character ▁in ▁the ▁text . ▁If ▁the ▁characters ▁do ▁not ▁match , ▁there ▁is ▁no ▁need ▁to ▁continue ▁searching ▁backwards ▁along ▁the ▁text . ▁If ▁the ▁character ▁in ▁the ▁text ▁does ▁not ▁match ▁any ▁of ▁the ▁characters ▁in ▁the ▁pattern , ▁then ▁the ▁next ▁character ▁in ▁the ▁text ▁to ▁check ▁is ▁located ▁ ▁characters ▁farther ▁along ▁the ▁text , ▁where ▁ ▁is ▁the ▁length ▁of ▁the ▁pattern . ▁If ▁the ▁character ▁in ▁the ▁text ▁is ▁in ▁the ▁pattern , ▁then ▁a ▁partial ▁shift ▁of ▁the ▁pattern ▁along ▁the ▁text ▁is ▁done ▁to ▁line ▁up ▁along ▁the ▁matching ▁character ▁and ▁the ▁process ▁is ▁repeated . ▁J ump ing ▁along ▁the ▁text ▁to ▁make ▁compar isons ▁rather ▁than ▁checking ▁every ▁character ▁in ▁the ▁text ▁decre ases ▁the ▁number ▁of ▁compar isons ▁that ▁have ▁to ▁be ▁made , ▁which ▁is ▁the ▁key ▁to ▁the ▁efficiency ▁of ▁the ▁algorithm . ▁ ▁More ▁formally , ▁the ▁algorithm ▁begins ▁at ▁alignment ▁, ▁so ▁the ▁start ▁of ▁ ▁is ▁aligned ▁with ▁the ▁start ▁of ▁. ▁Char acters ▁in ▁ ▁and ▁ ▁are ▁then ▁compared ▁starting ▁at ▁index ▁ ▁in ▁ ▁and ▁ ▁in ▁, ▁moving ▁back ward . ▁The ▁strings ▁are ▁matched ▁from ▁the ▁end ▁of ▁ ▁to ▁the ▁start ▁of ▁. ▁The ▁compar isons ▁continue ▁until ▁either ▁the ▁beginning ▁of ▁ ▁is ▁reached ▁(