전체 글(300)
-
4.6 Rabin-Karp’s algorithm(라빈-카프 알고리즘)
CS - 4. String Search and Manipulations - 4.6. Rabin-Karp's algorithm Rabin-Karp’s algorithm Rabin-Karp algorithm is a string searching algorithm that uses hashing to find any one of a set of pattern strings in a text. For strings of average length n, it performs in O(n+m) time with O(m) space, where m is the length of the pattern. It is often used in bioinformatics to search for DNA patterns. 라..
2024.02.22 -
Visual Studio on SQL server
보호되어 있는 글입니다.
2024.02.22 -
4.5 Boyer Moore Algorithm(보이어-무어 알고리즘)
CS - 4. String Search and Manipulations - 4.5. Boyer Moore Algorithm Boyer Moore Algorithm 💡Boyer Moore algorithm is a string searching algorithm that is used to find the index of a substring in a string. It is a very efficient algorithm that is used in many applications. It is used in text editors, compilers, and many other applications. 보이어 무어 알고리즘은 문자열에서 하위 문자열의 인덱스를 찾는 데 사용되는 문자열 검색 알고리즘입니다...
2024.02.21 -
4.4. Knuth Morris Pratt (KMP 알고리즘)
CS - 4. String Search and Manipulations - 4.4. Knuth morris pratt Knuth Morris Pratt 💡Knuth morris pratt is a string searching algorithm that uses a precomputed array to find the substring in a string. This array is known as the prefix function. The prefix function is the longest prefix that is also a suffix of a substring. The prefix function is used to skip the characters that are already matc..
2024.02.20 -
[MySQL] Cannot Connect to Database Server
보호되어 있는 글입니다.
2024.02.19 -
4.3 Brute Force Search(완전 탐색)
4. String Search and Manipulations - 4.3 Brute Force Search Brute Force Search Brute force search is a simple algorithm that checks for a pattern in a string by comparing each character of the string with the first character of the pattern. If the first character matches, it then compares the next character of the string with the next character of the pattern and so on. If all the characters of ..
2024.02.17