Introduction The Java Collections Framework isn’t just about data structures; it also offers a set of powerful algorithms for manipulating collections. These algorithms can save you time and make your code more robust and efficient. This guide aims to delve into the algorithms provided by the Java Collections Framework, particularly those available in the Collections […]
Java Collections API: Exploring Built-in Algorithms Read More »
Table of Contents 📚 Introduction to Tree Traversals Traversal is a fundamental operation in which we visit all the nodes of a tree and perform some operation (such as a print operation) at each node. In this post, we’ll discuss three commonly used traversals for binary trees: in-order, pre-order, and post-order. In-order Traversal In in-order
Table of Contents 📚 Introduction to Breadth-First Search 🌱 Breadth-First Search (BFS) is a traversal algorithm used for both trees and graphs. The algorithm starts from the root node (in a tree) or any arbitrary node (in a graph) and explores all its neighbors at the present depth before moving on to nodes at the
Breadth-First Search Read More »
Table of Contents 📚 Introduction to Depth-First Search 🌱 Depth-First Search (DFS) is an algorithm for traversing trees and graphs. The idea is to start from the root (in case of a tree) or any arbitrary node (in case of a graph), mark the node, and move to an adjacent unmarked node and continue this
Depth-First Search Read More »
Heap Sort is an efficient sorting algorithm that takes advantage of the properties of a binary heap data structure. It uses the heap to organize elements.
Quick Sort is a divide-and-conquer sorting algorithm that works by selecting a ‘pivot’ element and partitioning the array into two sub-arrays …
Merge Sort is one of the most efficient sorting algorithms, and it plays a fundamental role in computer science. This guide explain merge sort in details.
Insertion sort is a simple yet powerful sorting algorithm that is intuitive and easy to implement. It’s particularly useful for sorting small arrays.
Selection sort is another straightforward sorting algorithm that is particularly easy to understand and implement. Although not the most efficient …
Bubble sort is one of the simplest sorting algorithms that sorts a list by repeatedly swapping adjacent elements that are in the wrong order.