* @brief Swap numbers by reference(using pointers) * @param first pointer to first number * @param second pointer to second number * @returns void

Swap function to swap two values*/

Swap function to swap two values

Function to perform Ternary Search

--Create new trie node--*/

* @brief increment an 128-bit number by a given amount * * @param dest the value being incremented * @param n what dest is being increased by * *

* @brief To update the completion time, turn around time and waiting time of * the processes * @param root pointer to the head of the queue * @para

* @brief Function validatePosition * Responsible for checking if the position can receive the boat. * @param mat board * @param boat boat * @param

* @brief driver function to perform the hashing as described in specification * * pseudocode: (credit to authors of RFC 7693 listed above) * FUNCTI

The main function that finds the shortest path from given source to all other vertices using Bellman-Ford.It also detects negative weight cycle

The main function that finds the shortest path from given source to all other vertices using Dijkstra's Algorithm.It doesn't work on negative weights

The main function that finds the shortest path from a vertex to all other vertices using Floyd-Warshall Algorithm.

Euclid's algorithm

Insertion Sort */

The main function to construct MST using Kruskal's algorithm

Append 2 lists together */

Length of list */

Create and return a list */

* Check if element `v` is valid to place at (x,y) location. * @param a ::sudoku to check * @param x row to place value * @param y column to place v

* Check if a 3x3 box is valid * @param a matrix to check * @param x row index of the element to check * @param y column index of the element to che

* Check if `y`^th column is valid * @param a ::sudoku to check * @param x ignored row * @param y column to check * @param v value to check if it r

* Check if `x`^th row is valid * @param a ::sudoku to check * @param x row to check * @param y ignored column * @param v value to check if it repe

remove int from front of queue

check whether queue is empty

* @addtogroup sorting Sorting algorithms * @{ */ * Insertion sort algorithm implements using Recursion * @param arr array to be sorted * @param s

Initial stack */

A function that does union of two sets of x and y (uses union by rank)

[Heaviside activation * function](https://en.wikipedia.org/wiki/Heaviside_step_function) <img * src="https://upload.wikimedia.org/wikipedia/commons/

* Update the weights of the model using supervised learning for one feature * vector * * \param[in] ada adaline model to fit * \param[in] x featur

Adds the given edge to the graph

Adds bidirectional edge to graph

Adds the given edge to the graph

Creates a bidirectional graph

Adds the given edge to the graph

Creates a unidirectional graph

* add a digit to the large number * \param[in,out] num * \param[in] value value of the digit to insert */

* Function to add arbitrary length decimal integers stored in an array. * a + b = c = new b */

* Function to add arbitraty length decimal integers stored in an array.\n * a + b = c = new b */

* @brief Decrypts an affine ciphertext * * @param s string to be decrypted * @param key Key used when s was encrypted * * @returns void */

* @brief Encrypts character string `s` with key * * @param s string to be encrypted * @param key affine key used for encryption * * @returns void

* @brief Reserves memory for new node * @returns a pointer to the newly allocated node if memory IS successfully reserved * @returns `NULL` if memor

This is where the sorting of the array takes place * @param [in,out] a array to be sorted * @param [in] len Array Size */

* Function: binary_search * \brief algorithm that search the index of the given item * \details recursive function that search the given element in

* Bubble sort algorithm implements using recursion * @param arr array to be sorted * @param size size of array */

* Bubble sort algorithm implementation * @param arr array to be sorted * @param size size of array */

* @brief Bubble sort implementation * @param array_sort the array to be sorted * @returns void */

* @brief recursively constructs a AST from a preprocessed regex string * @param input regex * @returns pointer to the resulting tree */

! * Calculate centoid and assign it to the cluster variable * * @param observations an array of observations whose centroid is calculated * @para

! * Returns the index of centroid nearest to * given observation * * @param o observation * @param clusters array of cluster having centroids c

* @brief To calculate the average turn around time of all the processes * @param root pointer to the head of the queue * @returns float average turn

* @brief To calculate the average waiting time of all the processes * @param root pointer to the head of the queue * @returns float average waiting

Depth first search approach. Runtime: O(n) Space: O(1)

Check the node after the insertion step

Checks if a given number is devisable by every number between 1 and 20 * @param n number to check * @returns 0 if not divisible * @returns 1 if div

Pretty naive implementation. Just checks every number if it's devisable by 1 * through 20 * @param n number to check * @returns 0 if not divisible

* check for termination condition * \param[in] delta point at which to evaluate the polynomial * \returns 0 if termination not reached * \returns 1

* Computes the length of collatz sequence for a given * starting number */

* @brief To compare the priority of two processes based on their arrival time * and priority * @param a pointer to the first process * @param b poi

compte plays the role of strlen so we can change it by an strlen function if you want that

* @brief convert function * @param infix[] : infix array provided by user * @param postfix[] : empty array to be given to convert() * @returns post

* @brief Convert a string to the it's zigzag equivalent on a given number of * rows. * @param in the string in input. * @param numRows the desired

Converts octal number to decimal

* @brief Calculate the final length of the converted number * @param nb to convert * @param base calculated from alphabet * @return Converted nb st

* @brief Convert positive decimal integer into anybase recursively * @param nb to convert * @param alphabet inputed by user used for base convertion

* @brief Count func counts the number of * prime numbers. * @param arr contains the prime numbers * @param size denotes upto which prime numbers a

Counting sort according to the digit represented by place

* Get number of divisors of a given number * * If \f$x = a \times b\f$, then both \f$a\f$ and \f$b\f$ are divisors of * \f$x\f$. Since multiplicati

* Initialize the stack to NULL. */

This function is responsible for creating the Circularly Linked List right from the BEGINNING. */

Constructs a graph with V vertices and E edges

Allocates memory for graph data structure, in adjacency list format

Constructs a graph with V vertices and E edges