![]() |
TheAlgorithms/C++ 1.0.0
All the algorithms implemented in C++
|
| Nbacktracking | For vector container |
| Cgenerate_parentheses | Generate_parentheses class |
| Nciphers | Algorithms for encryption and decryption |
| Nelliptic_curve_key_exchange | Namespace elliptic_curve_key_exchange |
| CPoint | Definition of struct Point |
| CHillCipher | Implementation of Hill Cipher algorithm |
| Ndata_structures | For IO operations |
| Nlinked_list | |
| Clink | |
| Clist | |
| CNode | |
| Nlist_array | |
| Clist | Structure of List with supporting methods |
| Nqueue_using_array | |
| CQueue_Array | Queue_Array class containing the main data and also index of head and tail of the array |
| Nsparse_table | |
| CSparse_table | |
| Nstack_using_queue | |
| CStack | Stack Class implementation for basic methods of Stack Data Structure |
| Ntreap | Functions for the Treap algorithm implementation |
| CTreap | Struct representation of the treap |
| Ntree_234 | |
| CNode | 2-3-4 tree node class |
| CTree234 | 2-3-4 tree class |
| Ntrie_using_hashmap | |
| CTrie | Trie class, implementation of trie using hashmap in each trie node for all the characters of char16_t(UTF-16)type with methods to insert, delete, search, start with and to recommend words based on a given prefix |
| CNode | Struct representing a trie node |
| CBitset | Simple bitset implementation for bloom filter |
| CBloomFilter | Bloom filter template class |
| CNode | |
| CSegmentTree | Class representation of the segment tree |
| CSkipList | |
| CStack | Class representation of a stack |
| Ctrie | Trie implementation for small-case English alphabets a-z |
| Ndivide_and_conquer | For IO operations |
| Nstrassens_multiplication | |
| CMatrix | Matrix class |
| Ndouble_hashing | An implementation of hash table using double hashing algorithm |
| CEntry | |
| Ngeometry | For std::swap |
| Ngrahamscan | |
| CPoint | |
| Njarvis | |
| CPoint | |
| CConvexhull | |
| Ngraph | Graph Algorithms |
| Nis_graph_bipartite | |
| CGraph | Class for representing graph as an adjacency list |
| Ntopological_sort | |
| CGraph | Class that represents a directed graph and provides methods for manipulating the graph |
| CGraph | |
| CHKGraph | Represents Bipartite graph for Hopcroft Karp implementation |
| CLowestCommonAncestor | |
| CRootedTree | |
| Ngreedy_algorithms | For string class |
| Ndijkstra | Functions for the Dijkstra algorithm implementation |
| CGraph | Wrapper class for storing a graph |
| CBinaryAddition | A class to perform binary addition of two binary strings |
| CDigitSeparation | A class that provides methods to separate the digits of a large positive number |
| Nhashing | Used for assert |
| Nsha256 | |
| CHash | Contains hash array and functions to update it and convert it to a hexadecimal string |
| Nlinear_probing | An implementation of hash table using linear probing algorithm |
| CEntry | |
| Nmachine_learning | A* search algorithm |
| Naystar_search | |
| CEightPuzzle | A class defining EightPuzzle/15-Puzzle game |
| CAyStarSearch | A class defining A* search algorithm. for some initial state and final state |
| CInfo | Struct that handles all the information related to the current state |
| Ccomparison_operator | Custom comparator for open_list |
| Nk_nearest_neighbors | |
| CKnn | K-Nearest Neighbors (Knn) class using Euclidean distance as distance metric |
| Nneural_network | |
| Nlayers | |
| CDenseLayer | |
| CNeuralNetwork | |
| Cadaline | |
| Nmath | For assert |
| Nncr_modulo_p | |
| CNCRModuloP | Class which contains all methods required for calculating nCr mod p |
| Noperations_on_datastructures | For std::vector |
| Ncircular_linked_list | |
| CNode | A Node struct that represents a single Node in a Binary Tree |
| CCircularLinkedList | A class that implements a Circular Linked List |
| Ninorder_traversal_of_bst | |
| CNode | A Node structure representing a single node in BST |
| Nreverse_binary_tree | |
| CNode | A Node struct that represents a single node in a Binary Tree |
| CBinaryTree | A Binary Tree class that implements a Binary Search Tree (BST) by default |
| Ntrie_operations | |
| CTnode | Class defining the structure of trie node and containing the methods to perform operations on them |
| Nothers | For vector |
| NCache | Cache algorithm |
| CD_Node | Node for a doubly linked list with data, prev and next pointers |
| CLFUCache | LFUCache |
| CLRUCache | LRUCache |
| Niterative_tree_traversals | |
| CNode | Defines the structure of a node of the tree |
| CBinaryTree | Defines the functions associated with the binary tree |
| Nlru_cache | |
| CLRUCache | LRU cache class |
| Nrecursive_tree_traversals | |
| CNode | The structure to hold Nodes of the tree |
| CBT | BT used to make the entire structure of the binary tree and the functions associated with the binary tree |
| Nprobability | For std::string |
| Ngeometric_dist | |
| Cgeometric_distribution | A class to model the geometric distribution |
| Nwindowed_median | |
| CWindowedMedian | A class to calculate the median of a leading sliding window at the back of a stream of integer values |
| Nquadratic_probing | An implementation of hash table using quadratic probing algorithm |
| CEntry | |
| Nrange_queries | For std::vector |
| Nheavy_light_decomposition | |
| CTree | A Basic Tree, which supports binary lifting |
| CSG | Segment Tree, to store heavy chains |
| CHLD | The Heavy-Light Decomposition class |
| Cfenwick_tree | The class that initializes the Fenwick Tree |
| CperSegTree | Range query here is range sum, but the code can be modified to make different queries like range max or min |
| CNode | |
| Nsearch | For std::assert |
| Nsublist_search | |
| CNode | A Node structure representing a single link Node in a linked list |
| Nstatistics | Statistical algorithms |
| Cstats_computer1 | |
| Cstats_computer2 | |
| Nstrings | String algorithms |
| Nboyer_moore | Functions for the Boyer Moore algorithm implementation |
| Cpattern | A structure representing all the data we need to search the preprocessed pattern in text |
| Ntests | Testcases to check Union of Two Arrays |
| CCircularLinkedList | A class that implements a Circular Linked List |
| CNode | A Node struct that represents a single Node in a Binary Tree |
| Cadaline | |
| Cbinary_search_tree | The Binary Search Tree class |
| Cbst_node | A struct to represent a node in the Binary Search Tree |
| CBtree | |
| Ccatalan_numbers | Computes and caches Catalan numbers |
| Ccll | |
| CCompare | Comparator class for priority queue |
| Ccompare | |
| CComplex | Class Complex to represent complex numbers as a field |
| CCycleCheck | |
| Cdouble_linked_list | |
| Cdsu | Disjoint sets union data structure, class based representation |
| CEasterYearMonthDay | For assert |
| CEdge | |
| CEntry | |
| CFCFS | Class which implements the FCFS scheduling algorithm |
| CGraph | |
| Chash_chain | Chain class with a given modulus |
| CHKGraph | Represents Bipartite graph for Hopcroft Karp implementation |
| CItem | |
| Clarge_number | |
| Clinkedlist | |
| Clist | |
| CListNode | For IO operations |
| CLongest_Substring | Class that solves the Longest Substring Without Repeating Characters problem |
| CMemorisedFactorial | |
| CMinHeap | |
| CMinHeapNode | |
| Cmst | |
| CNode | |
| Cnode | |
| CPoint | |
| Cpriority_queue | STL class |
| Cquery | |
| CQueue | |
| Cqueue | |
| CRBtree | |
| CSegmentIntersection | |
| CSJF | Class which implements the SJF scheduling algorithm |
| CSolution | |
| Cstack | For std::invalid_argument |
| Cstack_linkedList | |
| Cstats_computer1 | |
| Cstats_computer2 | |
| CTestCase | Single example inputs and expected output of the function longest_common_string_length |
| CTestCases | Class encapsulating the necessary test cases |
| Ctower | |
| CTrie | |
| CTrieNode | |
| Cuint128_t | Class for 128-bit unsigned integer |
| Cuint256_t | Class for 256-bit unsigned integer |
| Cunordered_set | STL class |
| Citerator | STL iterator class |
| Cconst_iterator | STL iterator class |
| Creverse_iterator | STL iterator class |
| Cconst_reverse_iterator | STL iterator class |
| Cvector | STL class |
| Citerator | STL iterator class |
| Cconst_iterator | STL iterator class |
| Creverse_iterator | STL iterator class |
| Cconst_reverse_iterator | STL iterator class |