* Merge sort is a divide and conquer algorithm, it divides the * input array into two halves and calls itself for the two halves * and then calls me

* This method converts the bit representation and stores it as a decimal * number. */

* This method stores each bit value from LSB to MSB and then prints them back * from MSB to LSB */

* @brief Compute approximation using the midpoint-Euler * method in the given limits. * @param[in] dx step size * @param[in] x0 initial va

\addtogroup ode Ordinary Differential Equations * @{ */ * @brief Compute next step approximation using the midpoint-Euler * method. * @f[y_{n+1} =

* @brief Takes input of the cost of * three operations: Insert, Replace and Delete * and return the minimum cost among them. * @param x used to

Function returns the minimum number of swaps required to sort the array

* @param root of the tree * @returns node with minimum value in the tree */

* @brief Utility function that finds * the vertex with the minimum distance in `mdist`. * * @param mdist array of distances to each vertex * @para

Find modular inverse of a modulo m i.e. a number x such that (a*x)%m = 1 * * @param[in] a the number for which the modular inverse is queried * @pa

* Get character from the morse representation. * @param s Morse representation * @returns corresponding character */

This function multiplies x * with the number represented by res[]. * res_size is size of res[] or * number of digits in the number * represented b

performing selection sort on the linked list in an iterative manner

* @brief A utility function to find next to top in a stack. * @param S Stack to be used for the process. * @returns @param Point Co-ordinates of the

* @brief random tests for checking performance when an array doesn't contain an element */

* @brief Find total no. of connected components * @return Number of connected components */

* @brief Function to calculate the total number of digits in the number. * @param num Number * @return Total number of digits. */

Self test checks */

return opening paranthesis corresponding to the close paranthesis * @param[in] ch closed paranthesis character */

* Function implementing palindrome partitioning algorithm using lookup table * method. * @param str input string * @returns minimum number of parti

* @brief The partition function sorts the array from * start to end and uses the last element as the pivot. * @param arr the array to be sorted * @

* Print the triangle * \param [in,out] arr array containing Pascal numbers * \param [in] n depth of Pascal triangle to print * \result arr poin

* @brief A test case in which we search for every appearance of the word 'pat' * @param text The text in which we search for appearance of the word

* calculate the expected value over a time * e.g rate of 2.5 over 10 mins = 2.5 x 10 = 25 */

* probability of a success in range for Poisson dist (inclusive, inclusive) * \f[P = \sum_i p(\mu,i)\f] */

* poisson rate:\n * calculate the events per unit time\n * e.g 5 dollars every 2 mins = 5 / 2 = 2.5 */

* Evaluate the value of a polynomial with given coefficients * \param[in] coeffs coefficients of the polynomial * \param[in] x point at which to eva

computing integer power of a matrix using recursive multiplication. * @note A must be a square matrix for this algorithm. * \param [in] A base matri

* @brief This function calculates a raised to exponent b under modulo c using * modular exponentiation. * @param a integer base * @param b unsigned

* Function to compute A^n where A is a matrix. * @param T matrix * @param ex power * @returns resultant matrix */

This function finds power of a number x and print \f$x^n\f$ * @param x base * @param n exponent */

Prime factorization of a number */

Generate an increasingly large number of primes * and store in a list */

* @brief Utility function to print the distances to vertices. * * This function prints the distances to each vertex in a tabular format. If the * d

< Definition of the sequence type * @brief Print the magic sequence * @param s working memory for the sequence */

Utility function to print distances

Utility function to print distances

Prints huffman codes from the root of Huffman Tree.

* @brief Prints all the indexes of true values in the passed std::vector * @param primes The vector that has been passed through `sieve(...)` * @ret

* @brief Problem statement for a system with first-order differential * equations. Updates the system differential variables. * \note This function

* Projection Function * Takes input of 2 vectors along with their dimension and evaluates their * projection in temp * * @param x Vector 1 * @par

* @brief push the node to the front of the linked list. * @param node_ptr the node to be pushed */

* //Recursive function/method to push vertices into stack passed as parameter: * @param v vertices * @param st stack passed by reference * @param v

Finds empty spot * @param entry Instance of table entry * @param key key value to search/probe * @returns `true` if key is present * @returns `fal

Finds empty spot in a vector * @param entry vector to search in * @param key key to search for * @returns `true` if key is not present or is a `tou

Finds empty spot * @param entry instance to check in * @param key key value to hash * @return hash value of the key */

* Testing function */

* @brief random tests which cover cases when we have one, multiple or zero occurences of the value we're looking for */

* This is the recursive method of the ternary search which returns the index of * the element. * \param[in] left lower interval limit * \param[in]

* re-hash a string using known existing hash * \param[in] s source of string to hash * \param[in] old_index previous index of string * \param[in] n

* @brief This function finds root of the equation in given interval i.e. (x1,x2). * @param x1,x2 values for an interval in which root is present. @p

Rehashes the table into a bigger table * @returns none */

Rehashes the table into a bigger table * @returns None */

Rehashes the table into a bigger table * @returns None */

Information about removal process * @param key key value to hash and remove from table */

Information about removal process * @param key key value to remove from table */

Information about removal process * @param key key value to hash and remove */

Removes key. Leaves tombstone upon removal. * @param key key value to hash and remove from table */

Removes key. Leaves tombstone upon removal. * @param key key value to remove */

Removes key. Leaves tombstone upon removal. * @param key key value to hash and remove */

Function to remove the word which calls the helper function.

* @brief Utility function for reversing a list * @brief Using the current, previous, and next pointer. * @returns void */

* @brief Executes test cases * @returns void * */

* @brief Executes test cases * @returns void * */

* @brief Executes test cases * @returns void * */

* @brief A function to invoke all test cases * @returns void * */

* Function to compute and save exact solution for comparison * * \param [in] X0 initial value of independent variable * \param [in] X_M

* Function to compute and save exact solution for comparison * * \param [in] X0 initial value of independent variable * \param [in] X_M

* Function to compute and save exact solution for comparison * * \param [in] X0 initial value of independent variable * \param [in] X_M

* @brief Algorithm for scheduling CPU processes according to the First Come * First Serve(FCFS) scheduling algorithm. * * @details FCFS

* function searchs for @param find_elem in the list * @param find_elem to be searched for in the list */