Algorithms 2024 Project 1 Hanjoline Julceus

Algorithms 2024 Project 1 is a Java-based project exploring merge sort 1-4 algorithms

Installation

Clone the repository

$ git clone https://github.com/HanjolineJ/algorithms2024Project1.git

Overview

This project explores algorithmic techniques, particularly focusing on the divide-and-conquer method, with practical examples like Merge Sort.

Divide-and-Conquer Technique

The divide-and-conquer approach is a algorithmic technique where a problem is divided into subproblems, which are solved independently, and the results are merged. This method is commonly used in Merge Sort

Merge Sort Steps

Divide the array into two halves

Recursively sort each half

Merge the two sorted halves into a final sorted array

Commands

MergeSort1

• javac Mergesort1.java java Mergesort1

MergeSort2

• javac Mergesort2.java java Mergesort2

MergeSort3

• javac Mergesort3.java java Mergesort3

MergeSort4

• javac Node.java Mergesort4.java java Mergesort4

Contributing

Pull requests are welcome. For major changes, please open an issue first to discuss what you would like to change.

License

MIT Open source