https://github.com/rashres/sorting-algorithm-comparison

https://github.com/rashres/sorting-algorithm-comparison

algorithms data-structures java sorting

Last synced: about 1 year ago
JSON representation

• Host: GitHub
• URL: https://github.com/rashres/sorting-algorithm-comparison
• Owner: rashres
• Created: 2024-05-01T22:04:30.000Z (almost 2 years ago)
• Default Branch: main
• Last Pushed: 2024-11-06T21:29:42.000Z (over 1 year ago)
• Last Synced: 2025-01-27T14:50:44.623Z (about 1 year ago)
• Topics: algorithms, data-structures, java, sorting
• Language: Java
• Homepage:
• Size: 18.6 KB
• Stars: 0
• Watchers: 1
• Forks: 0
• Open Issues: 0
• Metadata Files:
  • Readme: README.md

Awesome Lists containing this project

README

          
# Sorting-Algorithm-Comparison



This project is designed to evaluate and compare the performance of five fundamental sorting algorithms: Selection Sort, Insertion Sort, Heap Sort, Merge Sort, and Quick Sort. The main goal is to analyze these algorithms based on the number of comparisons they make to sort an array of data and their time efficiency in milliseconds.

Comparisons: The total number of comparisons performed during the sorting process.

Time (Milliseconds): The total time taken to complete the sort, measured in milliseconds.