this is the phone directory which is built-in c++ language and the concept of data structure.
In This project, all contact is sorted in lexicographical order, and when a new contact is created at that time we connect his original position.
for searching in this project user can search with name(first name, last name), mobile number, email id., and the searching process is done by user entering in any case(lower case, upper case) of character like- {RaJkuMAr, RAJKUMAR, rajkumar,......}.
and when the user wanna delete the contact at that time we remove the current node(which node the user wanna remove) and connect the previous node to the next node.
and we can also update the existing contact and when the user updates any contact then maybe he is not now in the correct position then at that time we connect to his original new position means sort in lexicographical order.
In the delete all contacts: we can delete all contacts and return an empty set.
In the view all contacts: we print all contacts.
- Add New Contact
- Update Existing Contact
- Delete Contact
- View All Contact
- Search Contact
- Delete All Contact
- Exit
Programming Language: c++.
Data Structure : sorting, searching, doubly linked list.
- Github: Rajkumar Yadav
- Linkedin: Rajkumar Yadav