2 مستودعات
Algorithms for computing the longest common prefix of strings and their suffixes in linear time.
Distinct from String Processing Algorithms: Distinct from general string processing: focuses on the specific Z-algorithm for pattern matching.
Explore 2 awesome GitHub repositories matching software engineering & architecture · Z-array Value Calculation. Refine with filters or upvote what's useful.
This project is a comprehensive collection of common computer science algorithms and data structures implemented in Swift. It serves as an educational reference and library for studying computational complexity, algorithmic logic, and data structure engineering through practical code examples. The repository provides a wide suite of data structure implementations, including various types of linked lists, heaps, hash tables, and an extensive range of hierarchical trees such as Red-Black, B-Tree, and Splay trees. It also covers diverse sorting and searching techniques, from basic bubble sort to
Implements Z-array pre-processing to find the longest substring matching a prefix in linear time.
This project is a comprehensive, community-maintained knowledge base and toolkit designed for competitive programming. It serves as a centralized repository for algorithmic theory, data structures, and mathematical techniques, providing a structured reference for informatics and collegiate programming competitions. The project distinguishes itself by integrating educational content with a robust suite of automation utilities. It provides a complete workflow for competitive programming, including tools for automated test case generation, solution verification, and direct interaction with onlin
Implements Z-array calculation for linear-time pattern matching and prefix analysis.