Hacktoberfestadd codenew algorithm
Métricas do repositório
- Stars
- (13.462 stars)
- Métricas de merge de PR
- (Nenhuma PRs mesclada em 30d)
Description
This algorithm finds all occurrences of a pattern in a text in linear time. Let length of text be n and of pattern be m, then total time taken is O(m + n) with linear space complexity @AdiChat adding in python