PruningRadixTrie - 1000x faster Radix trie for prefix search & auto-complete

.NET Implementations of Trie Data Structures for Substring Search, Auto-completion and Intelli-sense. Includes: patricia trie, suffix trie and a trie implementation using Ukkonen's algorithm.

A lightweight full text indexer for .NET

DAWG String Dictionary in C#

Trie (a.k.a. prefix tree) C# implementation. Has constant-time string prefix lookup.

Designed by Engineers for Engineers. This is your One stop shop for all DSA queries! Here you will find implementation of all sorts of data structures and algorithms.

Very fast C# implementation of Aho Corasick algorithm based on Double Array Trie.

A trie (prefix tree) data structure implementation in C#.

Implementation of some known string algorithmn and data structures like: Rope, Trie, Knuth Morris Pratt, Boyer Moore, Levenshtein

Building and studying the DAWG data structure for fun

A collection of Data Structures and Algorithms for preparing to coding interviews.

C# solutions to common data structures and algorithm problems

Wordament solver that handles an arbitrary number of special tiles, finds the many-to-many word-path relationships, and approximates a best path.

Wordament-based desktop app for single-player practice.

An implementation of a trie-like data structure using Azure Table Storage to enable type-ahead style searching

A text search engine made in C#. Supports different operators and comes with an easy-to-use web application.

This repository contains all of my works of Data Structure and Algorithms course

High Performance C# Subnetting

C# implementation of a ternary search trie.

This project was inspired by the source code for the system intern immutable collections. It expands on the idea of a strong enumerable with a strong enumerator instead of the usual interface. This improves performance in foreach-loops massively the bigger the dataset gets. Additionally adds some minor extension methods for all collections.