# Introduction Merge sort is a popular sorting algorithm that uses the divide-and-conquer approach to sort an array. It is a stable, comparison-based algorithm that has a time complexity of O(n log n).
Click the virtual machine below to start practicing