Algoritmos de CadenasAdvanced
Coincidencia de Cadenas KMP
Algoritmo de Knuth-Morris-Pratt para coincidencia eficiente de patrones en cadenas. Usa una función de falla (arreglo LPS) para saltar comparaciones innecesarias, logrando complejidad de tiempo O(n+m). Esencial para búsqueda de texto, análisis de secuencias de ADN y detección de plagio.
#string#pattern-matching#preprocessing#text-search
Complexity Analysis
Time (Average)
O(n + m)Expected case performance
Space
O(m)Memory requirements
Time (Best)
O(n)Best case performance
Time (Worst)
O(n + m)Worst case performance
📚 CLRS Reference
Introduction to Algorithms•Chapter 32•Section 32.4
Presets:
Step: 1 / 0
500ms
SlowFast
Keyboard Shortcuts
Space Play/Pause← → StepR Reset1-4 Speed
Real-time Statistics
Algorithm Performance Metrics
Progress0%
Comparisons
0
Swaps
0
Array Accesses
0
Steps
1/ 0
Algorithm Visualization
Step 1 of 0
Initialize array to begin
Default
Comparing
Swapped
Sorted
Code Execution
Currently executing
Previously executed
Implementation