Skip to content

Commit 003821e

Browse files
committed
readme final and rabin-karp hash base change
1 parent 373485d commit 003821e

File tree

2 files changed

+3
-8
lines changed

2 files changed

+3
-8
lines changed

README.md

Lines changed: 2 additions & 7 deletions
Original file line numberDiff line numberDiff line change
@@ -14,13 +14,12 @@
1414

1515
- [Project Overview](#project-overview)
1616
- [Tech Stack](#tech-stack)
17-
- [Algorithms](#algorithms)
1817
- [Installation and Setup](#installation-and-setup)
1918
- [Get in Touch](#get-in-touch)
2019

2120
## Project Overview
2221

23-
TODO
22+
Understanding string search algorithms can be a challenge. To gain a deeper insight into these algorithms, it's crucial to not only understand their underlying principles but also trace their step-by-step execution. This project aims to help visualize some of the popular string search algorithms, making it easier to grasp their inner workings. In particular, we dive deep into the following three algorithms: brute-force, Knuth-Morris-Pratt (KMP), and Rabin-Karp.
2423

2524
## Tech stack
2625

@@ -32,11 +31,7 @@ TODO
3231
<img alt="Tailwind CSS" src="https://img.shields.io/badge/Tailwind_CSS-%2306B6D4?style=for-the-badge&logo=tailwindcss&logoColor=white">
3332
</p>
3433

35-
36-
## Algorithms
37-
TODO
38-
39-
## Installation and Setup
34+
## Installation and Setup
4035

4136
Fork this repository and clone it locally. Once completed, follow these steps:
4237

lib/algorithms/rabin-karp.ts

Lines changed: 1 addition & 1 deletion
Original file line numberDiff line numberDiff line change
@@ -1,7 +1,7 @@
11
import { progress, clearProgress, createGrid } from "@/lib/utils";
22
import { SearchResult } from "@/lib/types";
33

4-
const HASH_BASE = 101;
4+
const HASH_BASE = 2;
55

66
function calculateHash(str: string) {
77
let hashValue = 0;

0 commit comments

Comments
 (0)