Hacktoberfestadd codenew algorithm
倉庫指標
- Star
- (13,462 star)
- PR 合併指標
- (30 天內沒有已合併 PR)
描述
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