What is Merge Sort? Merge Sort is a sorting algorithm that uses a divide-and-conquer strategy to sort an array or list of elements. The algorithm works by recursively dividing the array into smaller sub-arrays until each sub-array contains a single element. It then merges these sub-arrays back together in a sorted manner. How Does Merge Sort Work? Merge Sort follows these fundamental steps: Divide : Split the array into two halves until each sub-array contains a single elemen

Understand the math concepts of graph traversal, recursion used in DFS and build your own spanning tree.

Segment Tree- querying and updating

Understand the DFS process. Input your own graph and visualize DFS traversal.

Visualizer for Dijkstra's Algorithm that shows how it works step-by-step

Kruskal's Algorithm (with Visualizer) used to find MST

Recognizing DP Patterns, Base Cases, Edge Cases

A helpful guide to define Dynamic Programming States

DP basics: Optimal Substructure, Overlapping Subproblems, Recursive approach vs Efficient DP approach

Visualizing step by step, how Quick Sort algorithm arranges data

A quick look at Selection sort, Insertion sort, Tim Sort, Bucket Sort and other sorting algorithms

Continuing from Part 1 of the post on Bubble Sort, here is a visualizer that helps us see how bubble sorting is carried out. Click on...

How does Bubble Sort algorithm work - a step-by-step process view.

In this post, we’ll explore various types of algorithms, their characteristics, and their use cases. 1. Sorting Algorithms Sorting...

Types of Data Structures and associated time and space complexities.