Category:Rabin-Karp string search algorithm

From LiteratePrograms
Jump to: navigation, search

The Rabin-Karp string search algorithm is an algorithm based on hashing for finding a substring inside a large string quickly. Although it has bad worst case time, it is quick on average and in practice, and it is particularly suited to searching for many different strings at once.

This category currently contains no pages or media.