| 일 | 월 | 화 | 수 | 목 | 금 | 토 |
|---|---|---|---|---|---|---|
| 1 | 2 | 3 | 4 | 5 | ||
| 6 | 7 | 8 | 9 | 10 | 11 | 12 |
| 13 | 14 | 15 | 16 | 17 | 18 | 19 |
| 20 | 21 | 22 | 23 | 24 | 25 | 26 |
| 27 | 28 | 29 | 30 |
Tags
- attribute
- 밴픽
- 시바견
- 315. Count of Smaller Numbers After Self
- 컴퓨터의 구조
- t1
- 운영체제
- Substring with Concatenation of All Words
- 30. Substring with Concatenation of All Words
- 프로그래머스
- Generator
- 43. Multiply Strings
- Class
- Python Implementation
- 715. Range Module
- 109. Convert Sorted List to Binary Search Tree
- Regular Expression
- 파이썬
- Protocol
- Python Code
- shiba
- DWG
- concurrency
- Decorator
- kaggle
- Convert Sorted List to Binary Search Tree
- LeetCode
- Python
- data science
- iterator
Archives
- Today
- Total
목록Rabin-Karp (1)
Scribbling
Rabin-Karp Algorithm
Rabin-Karp Algorithm is an efficient algorithm to search a string pattern in a given sentence. The core of the idea is to use hash function to compare strings. Time complexity is O(n), where n is length of the string. However, this is true only when there is no hash collision. Time complexity is O(n * m) if hash function is poorly selected (producing many hash collisions), where m is length of t..
Computer Science/Algorithms & Data Structures
2022. 11. 9. 03:41