Creates a graph with V vertices and E edges

Allocate memory for the entire graph structure

Constructs a graph with V vertices and E edges

Allocate memory for the entire graph structure

* @brief creates and initializes a NFA * @returns pointer to the newly created NFA */

* @brief creates and initializes a AST node * @param content data to initializes the node with * @returns pointer to the newly created node */

Allocate memory for a node

Allocate memory for a node

Allocates memory for our queue data structure

Creates a stack

Creates a stack

* create a square matrix of given size with random elements * \param[out] A matrix to create (must be pre-allocated in memory) * \param[in] N matrix

* creates a new node * param[in] data value to be inserted * \returns a pointer to the new node */

* @brief Create a Stack object * * @param cap Capacity of stack * @return DArrayStack* Newly created stack object pointer */

/////////////////////////////////////////////////////////////

This function initializes the queue to empty by making both front and rear as * NULL */

This function initializes the queue to empty by making both front and rear as * NULL */

Function sort the array using Cycle sort

* Return first order derivative of the function. * \f$f'(x)\f$ */

Function to convert integer month to string * \param day integer identifier of day (0 = Sunday and 7 = Saturday * \return pointer to string repres

function for convert decimal number to hexadecimal * number****************/

function for convert decimal numbers to octal numbers************/

* Decimal to binary using recursion algorithm. * For example, if number = 5, the function returns the decimal integer 101. * @param number positive

* @brief 8bit alaw to 16bit pcm * @param out signed 16bit pcm array * @param in unsigned 8bit alaw array * @param len length of alaw array * @ret

* This function clears the heap memory allocated by the Vector. * @params Vector* (a pointer to the Vector struct) * @returns: none */

Deletion procedure, which searches for the input key in the tree and removes * it if present * @param root pointer to parent node * @param data val

To delete a node from the tree

* deletion of a node from the tree * if the node isn't present in the tree, it takes no action. * param[in,out] root pointer to node pointer to the

* @brief Function for deletion of the first node in list * * @param head start pointer of list * @return ListNode* pointer to

* @brief Function for deletion of the last node in list * * @param head start pointer of list * @return ListNode* pointer to th

This function will delete a node with value k from the Linked List if such a node exists */

Returns item at front of queue and removes it from queue

* @brief destroys a transition rule object * @param rule pointer to the object to be deleted * @returns void */

* @brief destroys a NFA state * @param state pointer to the object to be deleted * @returns void */

Recursive dfs approach

Recursive dfs aproach

function to view entire stack

* @brief As this is stack implementation using dynamic array this function will * expand the size of the stack by twice as soon as the stack is full.

* @brief Implementation of game vs another player. * * @returns None */

* @brief The main function implements the search algorithm * @tparam T type of array * @param in_arr the input array * @param n size of the array

* @brief editInfo function is used to edit an element in the memoryInfo list. * @details This function is used to edit the number of bytes allocated

* @brief 16bit pcm to 8bit alaw * @param out unsigned 8bit alaw array * @param in signed 16bit pcm array * @param len length of pcm array * @retu

* Puts an item into the Queue. */

* @brief Utility function used to print an error message to `stderr`. * It prints `str` and an implementation-defined error * message corresponding

* @brief Utility function used to print an error message to `stderr`. * It prints `str` and an implementation-defined error * message corresponding

* @brief Utility function used to print an error message to `stderr`. * It prints `str` and an implementation-defined error * message corresponding

* Function to convert given quaternion to Euler angles. * \f{eqnarray*}{ * \phi & = & * \tan^{-1}\left[\frac{2\left(q_0q_1+q_2q_3\right)}{1-2\left(

* @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 function * @returns void */

* @brief performs the extended Euclidean algorithm on integer inputs a and b * * @param a first integer input * @param b second integer input * *

Fetch leetcode tasks from the Leetcode

* Get the \f$n^{th}\f$ and \f$n+1^{th}\f$ Fibonacci number using recursive * half-interval decimation. * \param [in] n index of Fibonacci number to

Creates a topological sorting of the graph

fills overlap with longest proper prefix which is also suffix for each index * in needle */

Search procedure, which looks for the input key in the tree and returns 1 if * it's present or 0 if it's not in the tree * @param root pointer to pa

* @brief helper function to manage empty character transitions * @param target target NFA * @param states pointer to results storage location * @pa

* @brief Returns the index having minimum value using recursion * @param arr array to be sorted * @param size size of array * @return min_index ind

Returns index of the maximum element in arr[0..n-1]

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

* @brief Compute next step approximation using the forward-Euler * method. @f[y_{n+1}=y_n + dx\cdot f\left(x_n,y_n\right)@f] * @param[in] dx step

* @brief Frees memory when program is terminating * @param node pointer to current node * @returns void */

Clear memory allocated by ::propagate function. * @param head pointer to first allocated instance. */

* Continuous loop to send and receive over the socket. * Exits when "exit" is sent from commandline. * @param sockfd socket handle number */

* Continuous loop to send and receive over the socket. * Exits when "exit" is sent from commandline. * @param sockfd socket handle number */

* Return value of the function to find the root for. * \f$f(x)\f$ */

Recursive function to return gcd of a and b

Compute [Greatest Common Divisor * (GCD)](https://en.wikipedia.org/wiki/Greatest_common_divisor) of two numbers * using Euclids algorithm * @param

* @brief Helper function that returns each operator's associativity * @param operator the operator to be queried * @returns '1' if the operator is l