User searchs for a word and the program try to find the word in documents under the files folder.
Number of the existance of the word for every file is found and these numbers are set to the max binomial heap, in this way, numbers are sorted in heap.
File names and file contents are also hold in binomial heap.
Lastly a defined number of documents on the top of the heap is printed to the user.
It is a small-scale search engine for words.
You can add the texts and files that to be searched for to files folder.
You can also change the number of documents that contains the word are displayed after the searching.
-> git clone https://github.com/mharikmert/Ranking-Documents-for-Information-Retrieval-with-Priority-Queues
-> gcc -o main main.c
-> ./main