Function to find floor value

converts infix to postfix expression

the InsertAtHead have a head and a data

the InsertAtTail have a tail and a data

Function to sort the elements of each bucket

Function to implement the KMP algorithm

function which is declare above for getting the maximum number

Recursive C++ program to search an element in linked list

Function to find the maximum revenue from cutting a rod of length (len) where the rod of length (i) has cost (prices[i - 1])

Wrapper function to call conTree()

==================================================== DSU UNION FUNCTION (union by comparing rank) ===============================================

Sorting based on element present in 0th index so weight first

character array and index

Bfs implementation to return the min_cap while traversing ,if present any

Using BFS as a searching algorithm

NOTE** BINARY SEARCH WORKS FOR ONLY SORTED ARRAY

Prints root of func(x) with error of epilon

Function to build a Max-Heap from the given array

Returning the maximum stocks

Function to check if elements returned by user * contains the elements in topological sorted form * V: number of vertices * *res: array containi

Function to construct segment tree from given array. This function allocates memory for segment tree and calls constructSTUtil() to fill the allocat

A recursive function that constructs Segment Tree for array[ss..se]. si is index of current node in segment tree st

The main function to construct BST from given preorder traversal. This function mainly uses constructTreeUtil()

A recursive function to construct BST from pre[]. preIndex is used to keep track of index in pre[].

Convert Function which takes in 24hour time and convert it to 12 hour format

Function to return the minimum cost of connecting the ropes.

to count occurrence of character in a string

method 1 : slow approach

method 2 : fast approach

A function to do counting sort of arr[] according to the digit represented by exp.

counting sort function

Function will create a linked list, new nodes will be added at the end of the list

Function will create a linked list, new nodes will be added at the end of the list

utility function to create cycle