Skip to content

The Boyer-Moore algorithm is a string search algorithm that efficiently searches for the occurrence of a pattern in a text. It works by pre-processing the pattern to determine the bad character rule and good suffix rule, which are used to quickly skip over sections of the text that cannot match the pattern. Time complexity of O(n/m)

Notifications You must be signed in to change notification settings

darian-catalin-cucer/boyer-moore-algorithm

Folders and files

NameName
Last commit message
Last commit date

Latest commit

 

History

2 Commits
 
 
 
 

Repository files navigation

Boyer-Moore Algorithms Android App

An open-source Android application that implements the Boyer-Moore string search algorithms in Kotlin.

Features

  • User-friendly interface for inputting text and search patterns
  • Implements both the Boyer-Moore and Boyer-Moore-Horspool algorithms
  • Option to compare the performance of the algorithms with other string search algorithms
  • Can be used by students, computer scientists, and software engineers alike

Getting Started

  1. Clone the repository: git clone https://github.com/cucerdariancatalin/BoyerMooreAlgorithms.git
  2. Open the project in Android Studio
  3. Build and run the app on an emulator or physical device

Contributing

We welcome contributions to the project. If you want to contribute, please fork the repository and submit a pull request with your changes.

License

This project is licensed under the MIT License. See LICENSE for details.

About

The Boyer-Moore algorithm is a string search algorithm that efficiently searches for the occurrence of a pattern in a text. It works by pre-processing the pattern to determine the bad character rule and good suffix rule, which are used to quickly skip over sections of the text that cannot match the pattern. Time complexity of O(n/m)

Topics

Resources

Stars

Watchers

Forks

Releases

No releases published

Packages

No packages published

Languages