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

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

Implementation of the Autosuggest feature using Trie Data structure

autocomplete text app with cpp GUI QT

Coursera course: Algorithms on Strings

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

Simple Trie Structure implementation in C++

System Programming. Implementation of Search Engine using a Trie structure

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

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

Data Structures and Algorithms

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

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.

Dictionary using trie

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

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.

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

Talleres entregables de la materia Algoritmos y Estructuras de datos 1

C++ Trie Implementation

An efficient way to search a contact's name from a contact list.An advanced data structure called 'TRIE' is used to optimize the time complexity.