Hacktoberfestadd codenew algorithm
Repository-Metriken
- Stars
- (13.462 Stars)
- PR-Merge-Metriken
- (Keine gemergten PRs in 30 T)
Beschreibung
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