- A simple telephone directory which maintains the names and telephone numbers of people in an alphabetical order.
- It allows searching for records through Knuth Morris Pratt algorithm based on substring matching.
- The algorithm matches entered substring with every name in the directory, and with not just the beginning of it but also checks for a match anywhere in the middle.
- Data structure used for implementing the same is AVL trees.
sahilupadhyay / telephonedirectory Goto Github PK
View Code? Open in Web Editor NEW:phone: Uses C++ to implement KMP algorithm in a telephone directory system.
React
Typescript
Django
Laravel
Facebook
Microsoft
Google
Alibaba
D3
Tencent