A Mini Search Engine in C++, using an inverted index and a trie.

autocomplete text app with cpp GUI QT

Coursera course: Algorithms on Strings

Implementation of the Autosuggest feature using Trie Data structure

Given replace map, we can replace all the correspond words in input file without wrong twice replace.

System Programming. Implementation of Search Engine using a Trie structure

Implement Trie model for adding and searching words in C++

Simple Trie Structure implementation in C++

A collection of C++ implementations of some complex data structures

A multilingual, blazingly fast, offline dictionary for CS163 Final Project

Data Structures and Algorithms

Dictionary using trie

An implementation of the wordBreak problem to split into all possible combinations of words that the original sentence could have been made up of. Takes the input from a file and outputs it to shell.

A simple word auto complete feature implemented using Trie Data Structure in C++.

This is a TrieSort or Flowers Sort named after Watson Flowers. It is linear with how many elements are there.

Trie implementation, made for LeetCode. See readme.md for details

Prefix Trie data structure with Pattern Matching, in C++

Talleres entregables de la materia Algoritmos y Estructuras de datos 1

C++ Trie Implementation

This is a simple console-based implementation of a Dictionary in Trie Data Structure. I have used a dataset of about 130,000 words which contains the Word, its meaning and its part of speech. The dataset is available here as synonyms.csv.