Hacktoberfestadd codenew algorithm
Metriche repository
- Star
- (13.462 star)
- Metriche merge PR
- (Nessuna PR mergiata in 30 g)
Descrizione
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