Design_Lab

Autumn Semester 2019-2020
Under the supervision of Professor Abhijit Das

Holy Grail of Logology [Link]

main.cpp

Brute force implementation, Time complexity O(nCs*s!) where n is the total no of words in dictionary of length s
Trie approach (non-parallel), Time complexity O(n*26^(s-1))

p_main.cpp

Trie approach (parallel), Time complexity O((n*26^(s-1))/t), where t is the number of threads

Both the trie approaches have pruning.

To compile:

To run: (input.txt contains no of words first and then words as input)

All constants are defined in main.h

Name		Name	Last commit message	Last commit date
Latest commit History 15 Commits
.ipynb_checkpoints		.ipynb_checkpoints
README.md		README.md
a.out		a.out
create_dict.ipynb		create_dict.ipynb
input.txt		input.txt
main.cpp		main.cpp
main.h		main.h
main.h.gch		main.h.gch
p_main.cpp		p_main.cpp
words.pickle		words.pickle