function to print array*/

Function for adding edges to graph

Function to print linked list */

Function to insert a node at the beginning of the linked list */

Go through the link to understand c standard library https://www.tutorialspoint.com/c_standard_library/stdarg_h.htm */ This is a type suitable for hol

Insertion in queue

Utility function to create a new node.

A utility function to get the middle index from corner indexes.

================================================================*/

for finding area of triangle*/

-------------------------------------------*/

Return sum of elements in range from index qs (query start) to qe (query end). It mainly uses getSumUtil()

To heapify a subtree rooted with node i which is an index in arr[]. n is size of heap

This function returns true if given linked list is circular, else false. */

function that checks whether it will be safe to assign num to the given row and col */

Queue traversal

Function to reverse the linked list */

linked list traversal Complexity: O(n) where n = number of nodes

Takes two lists sorted in increasing order, and splices their nodes together to make one big sorted list which is returned. */

Function For Implementing Best First Search Gives output path having lowest cost

Returns value of Binomial Coefficient C(n, k)

A Binomial coefficient based function to find nth catalan number in O(n) time

given a valid input for sudoku problem like one in the newspapers, it solves and returns a valid answer */