ParkParksu

ParkParksu

  • 분류 전체보기 (302)
    • 학습 (25)
      • Crack SQL Interview in 50 Q.. (1)
      • python (15)
      • Data Engineering (13)
      • Computer Science (12)
      • Article (1)
      • Linux (2)
      • C++ (1)
      • ubuntu (2)
    • CS - Roadmap.sh (71)
      • 1. Data structures (16)
      • 2. Asymptotic Notation (1)
      • 3. Common Algorithms (32)
      • 4. String Search and Manipu.. (6)
      • 5. Bitwise operators (1)
      • 6. Floating Point Numbers (1)
      • 7. Endianess (0)
      • 8. Character Encodings (1)
      • 9. Common UML Digrams (2)
      • 10. Design Patterns (5)
      • 11. Basic Math Skills (0)
      • 12. Complexity Classes (1)
      • 13. Tries (1)
      • 14. Balanced Search Tree (0)
      • 15. System Design (0)
      • 16. Databases (3)
      • 17. Networking (1)
      • 18. Security (0)
      • 19. How Computers Work (0)
      • 20. Processes and Threads (0)
      • 21. K-D Trees (0)
      • 22. Skip Lists (0)
    • Modern Robotics (3)
      • 1. Preview (2)
      • 2. Configuration Space (1)
    • Testing (0)
    • 프로젝트 (16)
      • 슬랙 봇 비서 만들기 (3)
      • 위젯형 번역기 만들기 (0)
      • 주간책톡 (6)
      • 구글 트렌드 봇 (4)
      • 안드로이드 간단한 메모장 앱 (2)
    • 글적글적 (2)
    • 머신러닝 (17)
      • 딥러닝 (11)
      • CNN (1)
      • RNN (2)
      • 자연어처리 (2)
      • 이미지처리 (0)
    • Programming (0)
    • Trouble shooting (35)
      • backend (3)
      • body (1)
  • 홈
  • 태그
  • 방명록
RSS 피드
로그인
로그아웃 글쓰기 관리

ParkParksu

컨텐츠 검색

태그

kruskal graph backtracking cache LRU 데이터엔지니어링 Text Search 최소신장트리 memory 이어드림스쿨 패스트캠퍼스 recursion string Git 재귀 Rabin-Karp’s algorithm LFU traversal sort 꼬리재귀

최근글

댓글

공지사항

아카이브

Brute Force Search(1)

  • 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
이전
1
다음
티스토리
© 2018 TISTORY. All rights reserved.

티스토리툴바