|
Algorithms_in_C++
1.0.0
Set of algorithms implemented in C++.
|
| ▼Nciphers | Base64 Encoding and Decoding |
| ►Nelliptic_curve_key_exchange | Namespace elliptic_curve_key_exchange |
| CHillCipher | Implementation of Hill Cipher algorithm |
| ▼Ndata_structures | Data Structures algorithms |
| ►Nlinked_list | |
| ►Nlist_array | |
| ►Nqueue_using_array | |
| ►Nsparse_table | |
| ►Ntree_234 | |
| ►Ntrie_using_hashmap | |
| CNode | |
| CSkipList | |
| Ctrie | Trie implementation for small-case English alphabets a-z |
| ▼Ndouble_hashing | An implementation of hash table using double hashing algorithm |
| CEntry | |
| ▼Ngeometry | Geometry algorithms |
| ►Njarvis | |
| ▼Ngraph | Graph Algorithms |
| ►Nis_graph_bipartite | |
| CGraph | |
| CHKGraph | Represents Bipartite graph for Hopcroft Karp implementation |
| CRootedTree | |
| CLowestCommonAncestor | |
| ▼Nlinear_probing | An implementation of hash table using linear probing algorithm |
| CEntry | |
| ▼Nmachine_learning | A* search algorithm |
| ►Naystar_search | |
| ►Nneural_network | |
| Cadaline | |
| ▼Nmath | For IO operations |
| ►Nncr_modulo_p | |
| ▼Noperations_on_datastructures | For std::vector |
| ►Ninorder_traversal_of_bst | |
| ►Ntrie_operations | |
| ▼Nothers | For vector |
| ►Niterative_tree_traversals | |
| ►Npostfix_expression | |
| ▼Nquadratic_probing | An implementation of hash table using quadratic probing algorithm |
| CEntry | |
| ▼Nrange_queries | Algorithms and Data Structures that support range queries and updates |
| ►Nheavy_light_decomposition | |
| ►CperSegTree | Range query here is range sum, but the code can be modified to make different queries like range max or min |
| ▼Nsearch | For std::vector |
| ►Nsublist_search | |
| ▼Nstatistics | Statistical algorithms |
| Cstats_computer1 | |
| Cstats_computer2 | |
| ▼Nstd | STL namespace |
| Cis_integral< uint128_t > | |
| Cis_arithmetic< uint128_t > | |
| Cis_unsigned< uint128_t > | |
| Cis_integral< uint256_t > | |
| Cis_arithmetic< uint256_t > | |
| Cis_unsigned< uint256_t > | |
| ▼Cbinary_search_tree | The Binary Search Tree class |
| Cbst_node | A struct to represent a node in the Binary Search Tree |
| CBtree | |
| Ccll | |
| Ccompare | |
| CComplex | Class Complex to represent complex numbers as a field |
| CCycleCheck | |
| Cdouble_linked_list | |
| CEdge | |
| CFenwickTree | |
| CGraph | |
| Chash_chain | Chain class with a given modulus |
| CItem | |
| Clarge_number | |
| Clinkedlist | |
| Clist | |
| CMinHeap | |
| CMinHeapNode | |
| Cmst | |
| CNode | |
| Cnode | |
| CPoint | |
| Cquery | |
| Cqueue | |
| CQueue | |
| CRBtree | |
| CSegmentIntersection | |
| CSolution | |
| Cstack | |
| Cstack_linkedList | |
| 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 |