naive-string-matcher

Program developed in Python designed to compare run-times of the naive string matching algorithm when implemented sequentially, and then parallelly. Tested with various lengths of both the target string and the search string.

python string-matching naive-string-matcher

Updated Sep 10, 2018
Python

JahnaviM737 / Analysis-of-Algorithms

Star

Executing important algorithms using java

backtracking nqueens-problem insertion-sort selection-sort greedy-algorithms string-matching graph-coloring backtracking-algorithm merge-sort quick-sort kmp-matcher fractional-knapsack naive-string-matcher min-max-algorithm job-sequencing-algorithm divide-and-conquer-algorithms

Updated May 12, 2021
Java

Improve this page

Add a description, image, and links to the naive-string-matcher topic page so that developers can more easily learn about it.

Curate this topic

Add this topic to your repo

To associate your repository with the naive-string-matcher topic, visit your repo's landing page and select "manage topics."

Learn more

Provide feedback

Saved searches

Use saved searches to filter your results more quickly

naive-string-matcher

Here are 7 public repositories matching this topic...

ARUNAGIRINATHAN-K / Search-App

Dimama / text_search_labs

kunalagra / DSA-Codes

Candida18 / Analysis-Of-Algorithms

kanow-algorithms / naive-string-matcher

ryangos323 / String_Matching

JahnaviM737 / Analysis-of-Algorithms

Improve this page

Add this topic to your repo