https://github.com/rorro6787/arraytreedictionary
C implementation of an ArrayTreeDictionary datastructure
https://github.com/rorro6787/arraytreedictionary
Last synced: 4 months ago
JSON representation
C implementation of an ArrayTreeDictionary datastructure
- Host: GitHub
- URL: https://github.com/rorro6787/arraytreedictionary
- Owner: rorro6787
- Created: 2023-03-21T13:01:24.000Z (almost 3 years ago)
- Default Branch: main
- Last Pushed: 2023-03-27T15:07:35.000Z (over 2 years ago)
- Last Synced: 2025-02-13T06:44:01.800Z (10 months ago)
- Language: C
- Homepage:
- Size: 22.5 KB
- Stars: 1
- Watchers: 1
- Forks: 0
- Open Issues: 0
-
Metadata Files:
- Readme: README.md
Awesome Lists containing this project
README
# ArrayTreeDictionary
This is an implementation in c of a DataStruture that acts like a list in which you can insert, remove words and look if they are inside in logarithmic time. One visual example of the structure if we tried to store the words [lake last land lord my lastly lock lie layer lan], would be:
## Atributtes of the DataStructure
The DataStructure itself is a pointer to an array of 26 nodes (1 for each letter in the alphabet) that will store 3 things: first of all, a boolean value that would clarify if the letter is being used and another one that would tell if that letter is the end of a word. A part of that each node would store a reference to another array of 26 nodes.
This way is really easy to decide if a word is stored or not in the structure. You only need n steps to decide if we already included that word (being n the length of the word).
## Longest Word Searching Algorithm
Using this Structure is very easy to create an algorithm that in any other structure would have an inimagible computation cost, but in this case with a more afordable cost. Basically, what this backtracking algorithm would do is: given an array of letters, return the longest string that can be formed doing any type of permutations to the original string and that it that is already inserted in the tree.
For example, if the tree had these words inserted -> [layer lan lies alies] and we are given the next set of letters -> "lseias", the algorithm should return the string "alies". In the source code the algorithm appears with the name of longestWord.
## Technology Used
- C
## Team
- Emilio Rodrigo Carreira Villalta