timo-bmgd / Sorting-Algorithms-and-Benchmark

Sorting Algorithms and Benchmark

This repository contains implementations of various sorting algorithms along with a benchmarking tool to compare their performance.

Getting Started

To get started with using the sorting algorithms and benchmarking tool provided in this repository, follow these steps:

1. Clone the repository to your local machine:

   git clone https://github.com/yourusername/Sorting-Algorithms-And-Benchmark.git

2. Navigate to the Sorting-Algorithms-And-Benchmark directory:

   cd Sorting-Algorithms-And-Benchmark

3. You can explore the different sorting algorithms implemented in the Sorting package.

4. Run the Benchmark class to compare the performance of sorting algorithms locally.

   javac Sorting/Benchmark.java
   java Sorting.Benchmark

   This will generate benchmark results for Merge Sort, Selection Sort, and Insertion Sort algorithms.

5. Feel free to modify the benchmark parameters in the Benchmark class to test with different array sizes and value ranges.

That's it! You're ready to explore and benchmark different sorting algorithms locally using this repository.