Author name: Abhay

In this tutorial, you will learn what is hashing, what a hash table is and what is a hash function. Hashing is a technique of mapping a large set of data into tabular indices. The importance of Hashing We know that the time complexity of search algorithms depends upon the number of elements in the […]

In this tutorial, you will learn about how the binary search algorithm works and its implementation using C. Searching is the process of finding whether or not a specific value exists in an array. The binary search algorithm can be used to search for an element in a sorted array. Working of Binary Search The

In this tutorial, you will learn how the linear search algorithm works and its implementation using C. Searching is the process of finding whether or not a specific value exists in an array. The linear search or sequential search works by checking every element of the array one by one until a match is found. Working of Linear Search Consider the following array. we have to search for

In this tutorial, you will learn the breadth first search (BFS) algorithm for traversing a graph data structure with examples. Depth-first search or depth-first traversal is a recursive algorithm used to visit all the vertices in a graph. Breadth First Search Algorithm In the BFS algorithm, the traversal starts from a node and then carries

In this tutorial, you will learn the depth first search (DFS) algorithm for traversing a graph data structure with examples. Depth-first search or depth-first traversal is a recursive algorithm used to visit all the vertices in a graph. Depth First Search Algorithm In the DFS algorithm, the traversal starts from a node and then follows