Skip to content

CS201-Project-X-Fast-Trie" is a C++ implementation of the X-Fast Trie data structure, designed for efficient storage and search of large sets of integers. The repository includes source code and detailed comments

Notifications You must be signed in to change notification settings

Jaiswal0786/CS201-Project-X-Fast-Trie

Folders and files

NameName
Last commit message
Last commit date

Latest commit

 

History

1 Commit
 
 
 
 

Repository files navigation

CS201-Project-X-Fast-Tries

CS201 Project on Data Structures

To run the code:

Open terminal. 

Then, write g++ code.cpp

The code will compile. 

Then, run the code using ./a.out command. 

Then, input the size of universe i.e. the maximum integer you can enter.

Then, input an interger (0-5) corresponding to the operation you want to perform.

You will get your desired output.

WARNINGS:

  1. DO NOT EXCEED THE SIZE OF UNIVERSE.
  2. DO NOT INPUT NEGATIVE INTEGERS.

About

CS201-Project-X-Fast-Trie" is a C++ implementation of the X-Fast Trie data structure, designed for efficient storage and search of large sets of integers. The repository includes source code and detailed comments

Topics

Resources

Stars

Watchers

Forks

Releases

No releases published

Packages

No packages published

Languages