https://github.com/yuryalencar/xsorts

Comparison of sorting methods (QuickSort, HeapSort and MergeSort)
https://github.com/yuryalencar/xsorts

algorithm-complexity comparation heap-sort heapsort merge-sort mergesort quick-sort quicksort

Last synced: 3 months ago
JSON representation

Comparison of sorting methods (QuickSort, HeapSort and MergeSort)

• Host: GitHub
• URL: https://github.com/yuryalencar/xsorts
• Owner: yuryalencar
• Created: 2017-11-29T07:07:58.000Z (almost 8 years ago)
• Default Branch: master
• Last Pushed: 2017-12-05T21:09:04.000Z (almost 8 years ago)
• Last Synced: 2025-05-31T17:31:35.212Z (6 months ago)
• Topics: algorithm-complexity, comparation, heap-sort, heapsort, merge-sort, mergesort, quick-sort, quicksort
• Language: Java
• Homepage:
• Size: 23.4 KB
• Stars: 0
• Watchers: 1
• Forks: 0
• Open Issues: 0
• Metadata Files:
  • Readme: README.md

Awesome Lists containing this project

README

          
# XSorts

Comparison of sorting methods (QuickSort, HeapSort and MergeSort)

To use it is necessary to inform at least two arguments and at most three.

Being them:

* The first: the file path with the data                                                      (Required)

* The second: the sort order, -a (all) -h (HeapSort) -q (Quick Sort) -m (MergeSort)           (Required)

* The third: to display the time required for type of sorts.                                  (Optional)