Just like DFS, BFS (Breadth-first Search ) is also a recursive traversal algorithm for searching all vertices of the graph or tree data structure. In this article, we will learn about BFS, its implementation,...
In the last article, we learned about graphs in data structures. Graphs are one of the efficient ways that are used to model daily life problems and find an optimal solution. In this article,...
We use graphs very often in our daily life. Whether it’s going to the office from home or going to a movie with your friends. We use graphs for finding the optimal solution to...
There is a long queue at the billing counter of a mall. Some people have put all of their groceries in the cart and some have only 8-10 items. You have only a packet...
Shell sort is one of the highly efficient algorithms. It is based on the insertion sort technique. The major difference between insertion sort and shell sort is that shell sort avoids large shifts of...
Suppose you are the head of an examination center. 4000 students are appearing for the examination and you have 50 invigilators at your center. After examination, you collect the answer sheets in random order....
Suppose you ran out of groceries. You run to a grocery store with a list of items with their priority numbers written alongside. For a small list, you can just see and find out...
Selection sort is a simple sorting where the control searches for the smallest element and puts it in the first index. In each iteration, it searches for the smallest element and puts it in...
Insertion sort is a sorting algorithm that most of us use in daily life. For example, while arranging a set of answer sheets in ascending order or arranging a deck of cards. After the...
Ever witnessed a car racing tournament? There are multiple laps in a race. While the race is in progress, let’s say team A is in 4th position. Team B is just behind team A...
