rot_word rotates the given word to the left. # Arguments `word` - The word to rotate # Returns The rotated word

Sets a specific bit in a number. Sets the bit at position `n` in `bits` to 1. see: [Set Bit](https://en.wikipedia.org/wiki/Bit_manipulation) # Argu

shift_rows applies the AES ShiftRows/InvShiftRows operation to the given block. The block is modified in place. # Arguments `block` - The block to a

Solves the nqueens problem (recursive) This function is part of the nqueens algorithms and inserts the queens at safe positions recursively. See [nq

Function to perform inorder traversal and store in a vector

Removes the smallest node from the tree, if one exists.

function to update a tree node

XOR cipher # Arguments `text` - A string slice that holds the text to be ciphered. `key` - A u8 that holds the key to be used for ciphering. # Retu

Check if a string is a valid morse code part. This function checks if a string contains only valid morse code characters ('.', '-', and ' '). # Argu

Decode a morse code token into an alphanumeric character. This function decodes a morse code token into its corresponding alphanumeric character. It

Add `val` to the `i`-th element # Arguments `i` - The index of the element to add `val` to `val` - The value to add to the `i`-th element # Example

Applies the ROT13 cipher to the given text. ROT13 is a simple letter substitution cipher that replaces a letter with the 13th letter after it in the

performs the Bellman-Ford algorithm on the given graph from the given start the graph is an undirected graph if there is a negative weighted loop it

Calculates the bit distance between two numbers. Returns the number of different bits between `a` and `b`. see: [Hamming Distance](https://en.wikipe

Counts the number of equal bits between two numbers. Returns the number of equal bits between `a` and `b`. see: [Hamming Distance](https://en.wikipe

Implements the Caesar Cipher based on cipher_crypt::caesar Rotates each ascii character by shift. The most basic example is ROT 13, which rotates 'a'

return two solutions (x1, x2) for Quadratic Residue problem x^2 = a (mod p), where p is an odd prime if a is Quadratic Nonresidues, return None

classical_fibonacci(n) returns the nth fibonacci number This function uses the definition of Fibonacci where: F(0) = 0, F(1) = 1 and F(n+1) = F(n) + F

returns the two closest points or None if there are zero or one point

Coin change via Dynamic Programming coin_change(coins, amount) returns the fewest number of coins that need to make up that amount. If that amount of

Coin Change Problem # Algorithm The vector coins holds all types of coins. The input argument n represents the value which has to be put together wi

Checks if an element may be in the Bloom Filter NOTE: `true` implies the element may be in the set, `false` implies the element is not in the set. The

If three points are aligned and are part of the convex hull then the three are kept. If one doesn't want to keep those points, it is easy to itera

Decode a string of ints into their corresponding letters in a Polybius square. Any invalid characters, or whitespace will be ignored. # Arguments `

Create a new, empty `BinarySearchTree`. # Examples ```rust use rust_algorithms::data_structures::BinarySearchTree; let tree: BinarySearchTree<i32>

Creates an empty `AVLTree`. # Examples ```rust use rust_algorithms::data_structures::AVLTree; let tree: AVLTree<i32> = Default::default(); assert!

Create a new HashTable with the default initial capacity. # Examples: ```rust use rust_algorithms::data_structures::HashTable; let hash_table: Hash

Deletes the minimum key in the `MinHeap`. # Returns: The minimum key in the `MinHeap`. # Panics: If the heap is empty. # Examples: ```rust use r