Skip to content

Eazcee/Trie-Based-Predictive-Text-System

View on GitHub ↗Related repositories →

This C program implements a trie data structure for predictive text suggestions. It allows inserting words with frequency values and querying the most likely next letters based on prefix input. By efficiently managing word frequencies and prefixes, this system demonstrates advanced data structures, recursive memory handling, and string processing.

active 2025-03-17 → 2025-03-17 (UTC)

Complete coverage28,564 / 28,564 hourly files (100%) · 2 absent upstream2023-08-15 → 2026-11-17 (UTC)
Events
2
Pushes
0
Pull requests
0
Issues
0
Stars
0
Forks
0

Activity over time

Daily event counts in the loaded window

Line chart, 1 days from 2025-03-17 to 2025-03-17. Pushes: 0 total, peak 0 in a day. Pull requests: 0 total, peak 0 in a day. Issues: 0 total, peak 0 in a day. Comments: 0 total, peak 0 in a day. Stars: 0 total, peak 0 in a day.

  • Pushes
  • Pull requests
  • Issues
  • Comments
  • Stars

Top contributors

Pushes, PRs, issues, reviews and comments — stars and forks excluded, so this is contribution rather than popularity

Nobody pushed, opened or commented here in the loaded window — this repo's activity is stars and forks only.

Recent activity

Latest issues, pull requests and releases

No issue or PR events — this repo's activity is pushes only.

Totals cover only the window loaded into ClickHouse and count events, not GitHub's lifetime totals — 0 stars here means stars gained during the window, not the repo's star count.