* @brief get min item (leftmost) in the current node * @return min item */

* @brief Get rightmose child of the current node * @return the rightmost child */

* * A utility function to check if x and y are from same set or not * @param x element of some set * @param y element of some set * */

* @brief Insert item to tree * @param item item to insert */

* @brief Insert a value to the index position * @param index index where to insert item * @param item value to insert * @param with_ch

* @brief InverseFastFourierTransform is a recursive function which returns list * of complex numbers * @param p List of Coefficents in form of compl

* @brief Check if node is a leaf * @return true if node is leaf, false otherwise */

* @brief Calculate the longest increasing subsequence for the specified numbers * @param a the array used to calculate the longest increasing subsequ

* Check if a set of points lie within given circle. This is true if the * distance of all the points from the centre of the circle is less than the

* @brief Print tree into a dot file * @param file_name output file name, if nullptr then use "out.dot" as default */

* @brief Set the item count of the node * * This is only used when we spliting and merging node where we need to do * some raw operatio

* @brief This function returns the shortest distance from the source * to the target if there is path between vertices 's' and 't'. * * @param work

* Private function to get detailed predictions (i.e. * activated neuron values). This function is used in * backpropagation, single predict

Checks for load factor here * @param key key value to hash and add to table */

Checks for load factor here * @param key key value to add to the table */

Adds entry using linear probing. Checks for load factor here * @param key key value to hash and add */

* add a digit at MSB to the large number **/

* @brief Binary addition * @param first, the input string 1 * @param second, the input string 2 * @returns the sum binary string */

* @brief Addition of points * @details Add given point to generate third point. More description can be * found * [here](https://en.wikipedia.org/w

* @brief This function uses the points in a given vector 'pts' (drawn at * random) to return an approximation of the number π. * @param pts Each ite

* @brief Asserts an array of complex numbers. * @param input Input array of complex numbers. . * @param expected Expected array of complex numbers.

* @brief atbash cipher encryption and decryption * @param text Plaintext to be encrypted * @returns encoded or decoded string */

* @brief Base64 Decoder * @details Decodes the Base64 string * @param base64_str Input as a Base64 string * @returns Base64 decoded string */

* @brief Base64 Encoder * @details Converts the given string to Base64 equivalent. * @param input Input as a string * @returns Base64 encoded strin

finds the variance of the binomial distribution * \param [in] n * \param [in] p * \returns \f$\sigma^2 = n\cdot p\cdot (1-p)\f$ */

* @brief the implementation of boruvka's algorithm * @param adj a graph adjancency matrix stored as 2d vectors. * @returns the MST as 2d vectors */

* @brief Displays the bottom element of the stack * * @return The bottom element of the stack * @throws std::out_of_range if the stack

* @brief creates and returns a new node * @param[in] data value stored in the node * @return newly created node */

* convert a string to an intger - called as hashing function * \param[in] s source of string to hash * \param[in] n length of substring to hash * \

* @brief Function to calculate the cross product of the passed arrays * containing the direction ratios of the two mathematical vectors. * @param A

* @brief a1z26 decryption implementation * @param text is the encrypted text input * @param bReturnUppercase is if the decoded string should be in u

* Decrypt given morse coded text. * @param text text to be decrypted * @returns new decrypted text */

* Decrypt given text using XOR cipher. * @param text text to be encrypted * @param key to be used for decryption * @return

* Decrypt given text using vigenere cipher. * @param text text to be decrypted * @param key key to be used for decryption *

* Decrypt given text using caesar cipher. * @param text text to be decrypted * @param shift number of shifts to be applied

* @brief This function dealocates memory related to the given list * It recursively deletes all of the nodes of the input list. * @param room the ro

* @brief removes a given element from AVL tree * @param root of the tree * @param[in] element the element to be deleted from the tree * @return roo

* @brief A utility function to return square of distance between p1 and p2. * @param p1 Co-ordinates of Point 1 <int, int>. * @param p2 Co-ordinates

* @brief Calculates and stores the result * of all the sub-problems, so that we don't have to recur to compute * the minimum cost of a particular

* @brief Checks if the stack is empty * @return true if the stack is empty, false otherwise */

* Encrypt given text using morse code. * @param text text to be encrypted * @returns new encrypted text */

* Encrypt given text using XOR cipher. * @param text text to be encrypted * @param key to be used for encyption * @return n

Unnamed namespace * Encrypt given text using vigenere cipher. * @param text text to be encrypted * @param key to be used for encrypt

Unnamed namespace * Encrypt given text using caesar cipher. * @param text text to be encrypted * @param shift number of shifts to be

Compute fibonacci numbers using the relation * \f[f(n)=f(n-1)+f(n-2)\f] * and returns the result as a large_number type. */

* @brief using fibonacci search algorithm finds an index of a given element in a sorted array * * @param arr sorted array * @param value value tha

Return true if the requested item (sent in as an argument) is in the list, otherwise return false */

* Update the weights of the model using supervised learning for one * feature vector * \param[in] x feature vector * \param[in] y known

Returns the minimum key (key at root) from min heap */

* @brief Method to print all the parents of i, or the path from i to * representative. * @param i element of some set * @returns void

* @return number of vertices in the graph. */

* Function to get X and Y from csv file (where X = data, Y = label) * @param file_name csv file name * @param last_label flag for whether la

* This function finds character for given value (i.e.A-Z) * @param x value for which we want character * @return correspon

* This function finds character for given value (i.e.A-Z) * @param x value for which we want character * @returns correspo

* @brief Get the KTH largest value (External method) * @param k The queried rank * @return The element ranked number x */

* @brief Get the predecessor node of element k * @param k The queried element * @return The predecessor */

* @brief Get the rank of specified element (External method) * @param k The queried element * @return The rank of element k */

* This function finds value for given character (i.e.0-25) * @param c character for which we want value * @returns returns c

This will return the index of the first free node present in the avail list */

A wrapper that is not available in all GLUT implementations. */

* Mode of hash detection : * Division method * \param [in] key to hash * \returns hash value for `key` */

* @param[in] root the root of the tree * @return height of tree */

* @brief inOrderIterative() function that will perform the inorder traversal * iteratively, and return the result array that contain the inorder tra

* @brief A function that initializes pattern * * @param str Text used for initialization * @param arg Initialized structure * @returns void */

* @brief Insert a new value to the stream * @param value New value to insert */

* Insert a word into the trie. * @param word which needs to be inserted into the string. */

insert string into the trie * @param str String to insert in the tree */

* @brief Checks whether integers are stored as big endian or not * @note Taken from [this](https://stackoverflow.com/a/1001373) StackOverflow * post

* @brief returns true if the given graph is bipartite else returns false * @param graph is a 2D matrix whose rows or the first index signify the node

* @brief function that checks whether the graph is bipartite or not * the function returns true if the graph is a bipartite graph * the function ret

* @brief The main sorting function * @details The iterative quick sort uses * the stack instead of recursion for saving * and restoring the environ

* @param root of the tree to be rotated * @return node after left rotation */

* @brief returns lower 64-bit integer part * @returns returns lower 64-bit integer part */

* @brief Calculates the magnitude of the mathematical vector from it's * direction ratios. * @param vec an array containing the direction ratios of

* Perform multiplication of two matrices. * * R2 must be equal to C1 * * Resultant matrix size should be R1xC2 * \param[in] A first matrix to multi

* @brief returns the maximum contiguous circular sum of an array * * @param arr is the array/vector * @return int which is the maximum sum */

* This function searches for the median of a linked list. * @param head The head of the linked list. * @returns Median node of the linked list. */