It is named bubble sort for the way that the smaller or larger elements bubble up to the top. Sometimes it is also known as sinking sort for the opposite reason. It is a comparison sort that repeatedly iterates through the list, compares the adjacent elements and swaps them if…

A heap is a special tree-based data structure where the tree is a complete tree or an almost complete tree which satisfy the heap property. Now, what is heap property? The heap property states that in a heap all the keys of children nodes must be greater than or equal…

Checking for balanced parentheses or balanced brackets is a very old and classic problem in the field of computer science. As we all know there are three kinds of parentheses or brackets. They are the round brackets, the curly brackets and the square brackets. …