https://github.com/saylidholam/word_frequency_count
Developed a mini desktop application in C++ using DSA concept : Hashing
https://github.com/saylidholam/word_frequency_count
cpp hashing
Last synced: 4 months ago
JSON representation
Developed a mini desktop application in C++ using DSA concept : Hashing
- Host: GitHub
- URL: https://github.com/saylidholam/word_frequency_count
- Owner: SayliDholam
- Created: 2024-02-11T08:23:44.000Z (over 1 year ago)
- Default Branch: main
- Last Pushed: 2024-05-25T04:52:52.000Z (about 1 year ago)
- Last Synced: 2024-11-27T13:37:21.759Z (6 months ago)
- Topics: cpp, hashing
- Language: C++
- Homepage:
- Size: 57.6 KB
- Stars: 4
- Watchers: 1
- Forks: 0
- Open Issues: 0
-
Metadata Files:
- Readme: README.md
Awesome Lists containing this project
README
# Word_Frequency_Count
Developed in C++ using DSA concept : Hashing
## Problem Statement
With this project, we can count the frequency of each word in a statement.
## Data Structure Concept Used: HASH TABLE
The hashing concept is involved implicitly when using unordered_map. The
unordered_map is a hash table implementation, and it uses a hash function to
map keys to indices in its underlying array.
This allows for efficient insertion, deletion, and retrieval of elements based on
their keys. In this code, the words in the input text serve as keys, and their
frequencies are stored in the hash table. The unordered_map handles the
hashing details internally.
A hash table is a data structure that uses a hash function to map keys to indices
in an array. This allows for efficient storage and retrieval of key-value pairs. In
the case of std::unordered_map, the keys are hashed, and the resulting hash.
*Output Screen*