Skip to content
#

kmp

Here are 369 public repositories matching this topic...

The Knuth-Morris-Pratt (KMP) Algorithm is a string matching algorithm used to find the occurrence of a pattern string in a text string. It uses a preprocessing step to create a failure function, which helps skip irrelevant comparisons and improves its efficiency compared to a simple string matching algorithm.

  • Updated Feb 13, 2023
  • Kotlin

A binary tree is a tree data structure in which each node has at most two children, referred to as the left and right child. The root node is the topmost node in the tree. This structure allows for efficient search, insertion, and deletion operations, making binary trees a common data structure in computer science.

  • Updated Feb 13, 2023
  • Kotlin

AVL Tree is a self-balancing binary search tree where the height difference of the left and right subtrees can't exceed 1. It's named after Adelson-Velsky and Landis and provides efficient search, insert, and delete operations with O(log n) time complexity, making it a reliable choice for large data sets.

  • Updated Feb 7, 2023
  • Kotlin

Long Short-Term Memory (LSTM) is a type of Recurrent Neural Network (RNN) that is capable of remembering long-term dependencies in sequential data by using memory cells, gates, and a hidden state to control the flow of information. It is widely used in time series analysis, natural language processing, and other tasks.

  • Updated Feb 13, 2023
  • Kotlin

Improve this page

Add a description, image, and links to the kmp 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 kmp topic, visit your repo's landing page and select "manage topics."

Learn more