This function checks whether the queue is empty

Generate a pair of public and private keys using the already set prime number and\ primitive root

longest common subsequence function

Mapping one plain-text alphabet to more than one cipher-text alphabet.

Function to find the maximum between two numbers

function to find the maximum Area

Function to find the minumum between two numbers

Function for finding minimum of two numbers */

this function is to find no. of parenthesis to be removed from the string

Function to create linked list

* This function returns the sum of squares of the individual digits for a given number*/

returns highest priority element without deleting it from queue

Argument e_d: Encryption or Decryption(true/false)

Assigns hash to a string

pop operation for the stack

pop operation for the stack

Function for 'Pop(Removing from Queue)'

returns (a^b)%mod

function to check Precedence of signs

preorder traversal of AVL tree and for each node it also displays their balance factor in brackets. */

Implement prime sieve function, it will store 0 in the primes array if that index is composite and 1 if prime

function to print circular linkedlist

function to print the Array

A utility function to print a given array of given size

printQueue function prints out the elements in the queue

printing the node in a pattern

printlist : it prints the linked list

push function pushes an element to the top of the stack

Function to push element in the stack.

insertion at beginning

push function of stack

function for 'Push(Adding to Queue)'

for checking whether Priority Queue is empty or not

for checking whether Priority Queue is empty or not

Takes an IntArray as arguments and returns a sorted IntArray to the caller function

* This function takes a number as a input and returns a number with the digits reversed*/

to check the valid neighbours

Return the score of input_string

Function to print nodes in a given linked list */

Function to Display Nodes of a Linked List */