DFS function runs a DFS from the source node (node), and keeps updating the max distance until all nodes are visited nd stores the node which is fou

returns euclidean distance between two points.

function for displaying the rotated 2darray/matrix

display function of stack

displays the content of linked list */

Display the entered list

display the arrray

function to display all the elements from hash table */

Takes input a matrix and its size. Prints the value row wise of the matrix.

Enqueue i.e insert at the REAR end

<p> This is a public method used to encrypt plainText using integer key using the Rail Fence Cipher algorithm. </p> <b>Process</b> <ul> <li>Place the

The enqueue function inserts an element into the queue

@return a new Complex object whose value is the complex exponential of this

returns level of the number

Function for QR-Sort Algorithm implementation.

Returns left-most or right-most index of key in a sorted list arr. This function takes an list and a key and finds the left most or right m

function to calculate hash values of text and pattern parameters: text, pattern, base value, large enough prime number return

Hashing function to get index for a given value

hash function

init(): this will initialize the stack for use

Function to print Nodes of a Tree */

this function is for inserting nodes in each list

Method to insert an item into the heap

checks whether the stack is empty or not

check whether Queue is empty or not

checks whether the stack is empty or not

check whether stack is empty or not

function to check whether stack is empty or not by returning 1 for empty and 0 for non-empty

Defining the isEmpty function to check whether the queue is empty or not

isEmpty(): checks if the both front and back are less than 0 it means Queue is empty

Checking if the Queue is full or not*/