-
Notifications
You must be signed in to change notification settings - Fork 0
ankitdbst/Utilities
This commit does not belong to any branch on this repository, and may belong to a fork outside of the repository.
Folders and files
Name | Name | Last commit message | Last commit date | |
---|---|---|---|---|
Repository files navigation
## Some utility codes Ciphers ------------- Class in python which encrypts and decrypts the following ciphers : - Caesar - Affine - Vigenere - Hill - RSA Graph ------------- Graph class in cpp which implements the following Algorithms : - Floyd Warshall : Transistive closure of path matrix - DFS Huffmann ------------- Implements the Huffman encryption technique on a given string Matrix ------------- Matrix class in cpp implements the following matrix useful operations for any nxn matrix : - Cofactor - Determinant - Adjoint - Transpose - Addition - Subtraction - Inverse - Multiplication Tic Tac Toe ------------- The traditional Tic Tac Toe game in python by implementing a game tree. Ternary Search Tree ------------------- This is a form of a trie (retrieval) data structure which is space efficient than a normal trie and is useful for prefix string searches. eg. Output results from the prefix string typed by the user Bloom Filters ------------- This is the space efficient probabilistic data structure to test whether an element is in the set. Used in spell checking. Priority Queues --------------- Priority queues using heap as the underlying data strucure. Ascending and descending priority queue implementation using min/max heap. Uses dynamic memory allocation as opposed to an array like implementation. Binary Search Trees ------------------- Class to implement BST searches and insertions
About
Some random utility codes
Resources
Stars
Watchers
Forks
Releases
No releases published
Packages 0
No packages published