Merge Sort Using Divide and Conquer
Algorithm Code Output
Education
Binary Search Using Divide and Conquer
Pseudo Code Algorithm for Binary Search. This is a recursive implementation of a Binary Search algorithm using the Divide and Conquer technique. Binary Search is efficient for finding an element in a sorted array, with a time complexity of O(log*n). Explanation of Pseudo Code: Function: BinarySearch(array, low, high, key) Parameters: Base Case: (Check if low
Circular Queue
Algorithm INPUT: FRONT IS A POINTER WHICH IS USED TO POINT TO THE ELEMENT FROM WHERE DELETION OF ELEMENT TAKES PLACE AND THE ELEMENT TO BE ENQUEUE AND REAR IS A POINTER WHICH POINTS TO THE ELEMENT FROM WHERE INSERTION TAKES PLACEOUTPUT: STACK AFTER PUSH OPERATIONDATA STRUCTURE: STACK USING ARRAY Algo Enqueue Algo Dequeue Code
Binary Search Tree Preorder , Postorder , Inorder Traversal
Algorithm INPUT: ROOT IS POINTER TO THE ROOT NODE OF THE TREEOUTPUT: ELEMENTS OF BINARY SEARCH TREEDATA STRUCTURE: BINARY TREE USING LINKEDLIST Code Output
Binary Search Tree Preorder , Postorder , Inorder Traversal Read More »
Queue Using LinkedList
Algorithm INPUT: FRONT IS A POINTER WHICH IS USED TO POINT TO THE ELEMENT FROM WHERE DELETION OF ELEMENT TAKES PLACE AND THE ELEMENT TO BE ENQUEUE AND REAR IS A POINTER WHICH POINTS TO THE ELEMENT FROM WHERE INSERTION TAKES PLACEOUTPUT: QUEUE AFTER OPERATIONDATA STRUCTURE: QUEUE USING LINKEDLIST Algo Enqueue Algo Dequeue Code Output