This program is a simple implementation of the merge sort algorithm to sort an array of integers. It generates a random array of size 10 with values between 0 and 100 using the random_array method.

This repository contains a simple Python implementation of the Merge Sort algorithm. Merge Sort is a classic divide-and-conquer sorting technique that recursively splits an array into halves, sorts ...