* @brief Returns the number of items present in the cache. * @return number of items in the cache */

* function adds new element to the end of the list * @param new_elem to be added to the end of the list */

* @brief Function to compute the nth Fibonacci number * @param n The index of the Fibonacci number to compute * @return uint64_t The nth Fibonacci n

* @brief push the node at first position in the linked list of given * frequency * @param freq the frequency mapping to the linked list wher

* @brief Utility function to return the size of the inner array * @returns the size of inner array */

* @brief Get the matrix shape * @returns pair of integer denoting total rows and columns */

Add new item to the stack */

Return the top element of the stack */

* \brief Member function to get imaginary value of our complex number. * Member function (getter) to access the class' im value. */

* @brief returns true if the cache is empty, false otherwise. * @return true if the cache is empty, false otherwise. */

* \brief Member function to get real value of our complex number. * Member function (getter) to access the class' re value. */

* @brief Recursive function to insert a value into the BST. * * @param node The node to search from. * @param new_value The value to in

* @brief pop the last node in the least frequently used linked list */

This functions fills a string with character c, n times and returns it * @note This can probably be replace by `memcpy` function. */

* @brief Find if a value and corresponding hash exist * * @param x value to search for * @param h corresponding hash key * @return

* @brief Refer to a page, or request a page from memory. * @param page The page that you are referring to. * @returns void * */

Caller of bitonicSort for sorting the entire array of length N in ASCENDING order */

* @brief Get the child pointer at position of index * @param index index of child to get * @return the child pointer */

Remove the top element of the stack */

* @brief will allocate the memory for a node and, along the data and return the * node. * @param data value that a particular node will contain. *

* @brief computes the n-th Catalan number and updates the cache. * @return the n-th Catalan number */

* @return the first element of the queue * @exception std::invalid_argument if queue is empty */

* @brief Function that add edge between two nodes or vertices of graph * * @param adj adjacency list of graph. * @param u any node or vertex of gra

* @brief Get item of the \index index * @param index the item index to get * @return the item */

* @brief returns the size of the EightPuzzle (number of row / column) * @return N, the size of the puzzle. */

* @brief Utility function that adds a new element at the end of the list * @param new_elem element be added at the end of the list */

* Get number of digits in the number **/

* @brief Getting the number of versions after updates so far which is equal * to the size of the pointers vector * @returns the number of ve

* @brief search a word/string that starts with a given prefix * @param prefix string to search for * @returns `true` if found * @return

* @brief Adds two binary strings and returns the result as a binary string. * @param a The first binary string. * @param b The second binary

Clear stack */

* @brief Method that combines two disjoint sets to which i and j belongs to * and make a single set having a common representative. * @param

* @brief Function that adds an edge between two nodes or vertices of graph * @param u Start node of the edge * @param v End node of the edge

* @brief search a word/string inside the trie * @param word string to search for * @returns `true` if found * @returns `false` if not f

* @brief Updates a range of the segment tree * * @param segtree the segment tree * @param lazy for lazy propagation * @param start lower i

* @brief Function that add edge between two nodes or vertices of graph * * @param adj1 adjacency list for the direct search * @param adj2 adjacency

* @brief Function that add edge between two nodes or vertices of graph * * @param u any node or vertex of graph * @param v any node or vertex of gr

* @brief This function calculates number raised to exponent power under modulo * mod using [Modular * Exponentiation](https://github.com/TheAlgorith

* @brief function to add edge from u to v * @param u is the position of first vertex * @param v is the position of second vertex */

* @brief Adds an edge to the graph * @param src the graph the edge should be added to * @param dst the position where the edge should be add

* @brief insert the string into the trie * @param word string to insert in the trie */

* @brief Rotates the bits of a 32-bit unsigned integer * @param n Integer to rotate * @param rotate Number of bits to rotate * @return uint32_t The

* @brief Utility function to find the i th element of the list * @returns the i th element of the list */

* @brief Get the item count that current saved in the node * @return item count */

* @brief * Adds and edge between two vertices of graph say u and v in this * case. * * @param adj Adjacency list representation of graph * @param

* @brief inserts a new item into the queue */

* A function that implements Horspool's algorithm. * @param text is the string that we are searching if there is a substring * @param prototype is t

* @brief A function that implements Manacher's algorithm * @param prototype is the string where algorithm finds a palindromic substring. * This stri

* @brief Classify sample. * @param sample sample * @param k number of neighbors * @return int label of most frequent neighbors */

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

* Helper function to generate a random number in a given interval. * \n Steps: * 1. `r1 = rand() % 100` gets a random number between 0 and 99 * 2.

* Helper function to generate a random number in a given interval. * \n Steps: * 1. `r1 = rand() % 100` gets a random number between 0 and 99 * 2.

* @brief Function to calculate binomial coefficients * @param n first value * @param k second value * @return binomial coefficient for n and k */

* @brief function to find factorial of given number * @param n is the number which is to be factorialized * @warning Maximum value for the parameter

* This function returns the hamming distance between two integers. * @param a the first number * @param b the second number * @returns the number o

* @brief Checks if a number is even or odd using bitwise AND. * @param N The number to check. * @returns "Even" if N is even, "Odd" if N is odd.

* @brief Function to check if the given number is prime or not. * @param num number to be checked. * @return true if number is a prime * @return fa

* @brief Function to calculate the trapped rainwater * @param heights Array representing the heights of walls * @return The amount of trapped rainwa

* @brief Function to calculate the trapped rainwater * @param heights Array representing the heights of walls * @return The amount of trapped rainwa

* @brief Erase element (External method) * @param k Key to erase */

* @brief prints the minimum, maximum and size of the set to which i belongs * to * @param i element of some set * @returns void */

* @brief Returns the character at pos after the input is padded * @param input Input string * @param pos Position of character to be returned * @re

* @brief Converts the string to bytestring and calls the main algorithm * @param message Plain character message to hash * @return void* Pointer to

* @brief This function computes the probability to have success in a given * range of tries * @details Computes P(min_tries <= x <= max_trie

* Save a given n-dimensional data martix to file. * * \param[in] fname filename to save in (gets overwriten without confirmation) * \param[in] X ma

* @brief Transforms the 160-bit SHA-1 signature into a 40 char hex string * @param sig The SHA-1 signature (Expected 20 bytes) * @return std::string

* @brief Transforms the 128-bit MD5 signature into a 32 char hex string * @param sig The MD5 signature (Expected 16 bytes) * @return std::string The

Compute the Euclidian distance between two points \f$A\equiv(x_1,y_1)\f$ and * \f$B\equiv(x_2,y_2)\f$ using the formula: * \f[d=\sqrt{\left(x_1-x_2\

* \brief [Algorithm implementation for linear search] * \param [in] array array to search in * \param [in] size length of array * \param [in] key k

* @brief Set child pointer to the position of index * @param index children index * @param child pointer to set */

* @brief Adding two string * @details Adds two long integer, only used for printing numbers * @param first First integer string * @param second Sec

* @brief Adds a new Node to the Binary Tree */

* @brief The main function implements set bit count * @param n is the number whose set bit will be counted * @returns total number of set-bits in th

* @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 Function that finds the month and day of Easter * @params param1 An int "y" of the year you want to find Easter on after * 1582 * @returns

* @brief get the value of the key-value pair if exists * @param key key of the key-value pair * @return the value mapped to the given key

* @brief get the value of the key-value pair if exists * @param key key of the key-value pair * @return the value mapped to the given key

* @brief Insert element (External method) * @param k Key to insert */

* @brief The main function implements check for power of 2 * @param n is the number who will be checked * @returns either true or false */

* @brief Give a vector of data, * it adds each element of vector in the linked list and return the address of * head pointer. * @param data A vecto

* @brief calculates the modular inverse. * @param a Integer value for the base * @param m Integer value for modulo * @return The result that is the

* @brief The main function implements checking the next number * @param x the number that will be calculated * @returns a number */

search a string exists inside a given root trie * @param str string to search for * @param index start index to search from * @returns

* @brief Creates a new matrix and returns a part of it. * @param row_start start of the row * @param row_end end of the row * @param co

* @brief Self-test implementations * @param vals Stream of values * @param windowSize Size of sliding window */

* @brief Wrapper function to initiate the unbounded knapsack calculation. * * @param N Number of items. * @param W Maximum weight capacity of the k

* @brief returns upper 128-bit integer part * @returns returns upper 128-bit integer part */