How does the Horspool’s algorithm work?

Question

What UE does when UE is in idle mode ? How frequently ue look for paging and through which feature / algorithm ?

Answer 1

Searching a large block of text to find the first occurrence of a substring (which we will call the ‘pattern’). This particular operation is provided in most text editing systems and it also has applications in bibliographic retrieval systems. Since the text tobe searched can be overwhelmingly large — perhaps hundreds of thousands of characters, itis important to use efficient techniques.

Boyer and Moore algorithm (Horspool)is a truly practical approach.
As in the Boyer-Moore algorithm, the pattern is compared from right to left with the text. After a complete match or in case of a mismatch, the pattern is shifted according to the precomputed function occ.

void horspoolSearch()
{
    int i=0, j;
    while (i<=n-m)
    {
        j=m-1;
        while (j>=0 && p[j]==t[i+j]) j--;
        if (j<0) report(i);
        i+=m-1;
        i-=occ[t[i]];
    }
}