Sorting Method

• 

  Source Code

• 

  Output

What it does

Wrote a Java Code for sorting an array using the divide-and-conquer algorithm

How we built it

The merge sort method involves sorting an array of elements in ascending (or descending) order. It involves breaking the problem into smaller parts, solving them individually, and combining the results. Split the array into two halves. Continue splitting until each sub-array has one element (base case) or no elements (trivial case). Sort the smaller sub-arrays recursively. Merge the sorted sub-arrays into a single sorted array.

Built With

• java