https://github.com/mharikmert/search-engine-simulation
A simple word search engine using Binomial Heap Algorithm with C Programming Language
https://github.com/mharikmert/search-engine-simulation
binomial-heap c priority-queues
Last synced: about 2 months ago
JSON representation
A simple word search engine using Binomial Heap Algorithm with C Programming Language
- Host: GitHub
- URL: https://github.com/mharikmert/search-engine-simulation
- Owner: mharikmert
- Created: 2021-03-15T14:15:59.000Z (about 4 years ago)
- Default Branch: master
- Last Pushed: 2021-03-15T17:50:00.000Z (about 4 years ago)
- Last Synced: 2025-01-30T09:29:06.545Z (4 months ago)
- Topics: binomial-heap, c, priority-queues
- Language: C
- Homepage:
- Size: 56.6 KB
- Stars: 1
- Watchers: 1
- Forks: 0
- Open Issues: 0
-
Metadata Files:
- Readme: README.md
Awesome Lists containing this project
README
## Ranking-Documents-for-Information-Retrieval-with-Priority-Queues
### How it works
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.## How to use
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.


### Clone, Compile and Run
```
-> git clone https://github.com/mharikmert/Ranking-Documents-for-Information-Retrieval-with-Priority-Queues
-> gcc -o main main.c
-> ./main```