equation 1 * \f[f(y) = 3y - \cos y -2\f] */

define the derivative function \f$f'(x)\f$ * For the current problem, it is: * \f[ * f'(x) = 3x^2 - 4 * \f] */

equation 2 * \f[f(y) = \frac{\cos y+2}{2}\f] */

* function erases old element from the list * @param old_elem to be erased from the list */

* @brief Evaluate answer using given last two operands from and operation * @param a second last added operand which will be used for evaluation * @

* Function to evaluate model on supplied data * @param X array of feature vectors (input data) * @param Y array of target values (label)

* @brief Exact solution of the problem. Used for solution comparison. * * @param[in] x independent variable * @param[in,out] y dependent varia

* @brief Exact solution of the problem. Used for solution comparison. * * @param[in] x independent variable * @param[in,out] y dependent varia

* @brief Exact solution of the problem. Used for solution comparison. * * @param[in] x independent variable * @param[in,out] y dependent varia

* @brief example showing the usage of the math::ncr_modulo_p::NCRModuloP class */

* @brief Function that checks if the string passed in param is present in * the the unordered_set passed * * @param str the string to be searched

* @brief Utility function for depth first seach algorithm * this function explores the vertex which is passed into. * * @param adj adjacency list o

* * \brief * Explores the given vertex, exploring a vertex means traversing * over all the vertices which are connected to the vertex that is * cu

Method to remove minimum element (or root) from min heap

* Compute factorial of a given number */

Function to read the number from stdin. The function reads input until a non * numeric character is entered. */

Fibonacci iterator * \param [in] n n^th Fibonacci number */

* @brief Sub-solutions filtering * @param s working memory for the sequence * @param depth current depth in tree * @returns true if the sub-solutio

Function to find the Minimum number of coins required to get Sum S

* @brief Finds and return the minimum node in BST. * @param root A pointer to root node. * @returns Node* Pointer to the found node * */

* @brief Returns true if arr can be partitioned in two subsets of equal sum, * otherwise false * @param arr vector containing elements * @param siz

* A function that finds the shift table of the given prototype string that we need in Horpool's algorithm. * @param prototype is the substring that w

* @brief Self-test implementations * @returns void */

* Function to fit model on supplied data * @param X array of feature vectors * @param Y array of target values * @param epochs number o

* Function to fit model on data stored in csv file * @param file_name csv file name * @param last_label flag for whether label is in first o

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

\addtogroup ode Ordinary Differential Equations * Integration functions for implementations with solving [ordinary differential * equations](https:/

* Function for finding greatest common divisor of two numbers. * @params two integers x and y whose gcd we want to find. * @return greatest common d

* @brief finds the values x and y such that a*x + b*y = gcd(a,b) * * @param[in] a the first input of the gcd * @param[in] a the second input of the

* @brief Function to compute GCD of 2 numbers x and y * @param x First number * @param y Second number * @return GCD of x and y via recursion */

Arrange sequence of numbers from '1' in a matrix form * \param [out] a matrix to fill * \param [in] r number of rows * \param [in] c number of colu

* @brief Find all possible states after processing all possible * moves, given the current state of the puzzle * @returns list of vector con

* @brief Generate samples according to some pdf * @details This function uses Metropolis-Hastings to generate random numbers. * It generates a seque

* @brief Returns a random number between [0,1] * @returns A uniformly distributed random number between 0 (included) and 1 * (included) */

* Creates convex hull of a set of n points. * There must be 3 points at least for the convex hull to exist * *

* @brief Generate the partial match table aka failure function for a pattern to * search. * @param pattern text for which to create the partial matc

* @brief Gets the median of the values in the sliding window * @return Median of sliding window. For even window size return the average * b

* @brief A naive and inefficient method to obtain the median of the sliding * window. Used for testing! * @return Median of sliding window.

* @brief Searches the given data in BST and returns the pointer to the node * containing that data. * @param root Pointer to the root node of the BS

* @brief Get the number of nodes in the graph * @returns The number of nodes */

* @brief Takes the start and end indices of an array and returns a random * int64_teger between the range of those two for selecting pivot element.

* @brief Get all values of the BST in in-order order. * * @return std::vector<T> List of values, sorted in in-order order. */

* @brief Get all values of the BST in post-order order. * * @return std::vector<T> List of values, sorted in post-order order. */

* @brief Get all values of the BST in pre-order order. * * @return std::vector<T> List of values, sorted in pre-order order. */

* get_input function is to receive input from standard IO * @todo @christianbender Get input from STDIO or write input to memory as done * above. *

* Get minimum value and index of the value in a matrix * \param[in] X matrix to search * \param[in] N number of points in the vector * \param[out]

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

* @return example data used in the tests of ::longest_common_string_length */

* @brief The SHA-1 algorithm itself, taking in a bytestring * @param input_bs The bytestring to hash * @param input_size The size (in BYTES) of the

* @brief The MD5 algorithm itself, taking in a bytestring * @param input_bs The bytestring to hash * @param input_size The size (in BYTES) of the in

* Input the key to be searched, and get the hash header position through the H * (int key) function, then one-dimensional linear search. If found @re

* @brief A function that preprocess the bad char table * * @param str The string being preprocessed * @param arg The bad char table * @returns voi

* @brief A function that preprocess the good suffix thable * * @param str The string being preprocessed * @param arg The good suffix table * @retu

The function will insert the given data * into the front of the linked list. */

* Inserts elements with given key and value; * It's level is computed by randomLevel() function. * @param key is number that is used for com

this function sorts array from left index to to right index which is of size atmost RUN

* @brief Puts user in a loop where inputs can be given and SHA-1 hash will be * computed and printed * @returns void */

* @brief Puts user in a loop where inputs can be given and MD5 hash will be * computed and printed * @returns void */

* @brief The main function which implements interpolation search * @param arr vector to be searched in * @param number value to be searched * @retu

* @brief Check if an integer is a prime number in \f$O(\sqrt{m})\f$ time. * @param m An intger to check for primality * @return true if the number i

* @brief Checks if scanned string is a number * @param s scanned string * @returns bool boolean value if string is number */

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

jump search implementation */

function/method to implement Kosaraju's Algorithm: * Info about the method * @param V vertices in graph * @param adj array of vectors that represent a

* @brief Rotates the bits of a 32-bit unsigned integer * @param n Integer to rotate * @param rotate How many bits for the rotation * @return uint32

* @brief Allocates a new node in heap for given data and returns it's pointer. * @param data Data for the node. * @returns A pointer to the newly al

size of each set * @brief function the initialize every node as it's own parent * @returns void */

* * The merge() function is used for merging two halves. * The merge(arr, l, m, r) is key process that assumes that * arr[l..m] and arr[m+1..r] are

merge function merges the sorted runs