https://github.com/anilerc/search-engine-binomial-heap

A "search engine-like" programme in C, utilizing binomial heap data structure to obtain a priority queue, based on word frequencies.
https://github.com/anilerc/search-engine-binomial-heap

Last synced: 9 months ago
JSON representation

A "search engine-like" programme in C, utilizing binomial heap data structure to obtain a priority queue, based on word frequencies.

• Host: GitHub
• URL: https://github.com/anilerc/search-engine-binomial-heap
• Owner: anilerc
• Created: 2021-12-07T20:01:40.000Z (over 4 years ago)
• Default Branch: main
• Last Pushed: 2021-12-07T20:07:55.000Z (over 4 years ago)
• Last Synced: 2025-02-26T04:41:24.563Z (over 1 year ago)
• Language: C
• Homepage:
• Size: 651 KB
• Stars: 0
• Watchers: 1
• Forks: 0
• Open Issues: 0
• Metadata Files:
  • Readme: README.md

Awesome Lists containing this project

README

          
# search-engine-binomial-heap

A search engine-like programme in C, this programme reads 42 text files, searchs for a keyword in all of them, and then sorts and retrieves them in a binomial heap data strcuture,

following the logic of a priority queue.

More occurences of the word bring more significance.

Created for CSE 2025 DATA STRUCTURES course.