Skip to content

Project that consists of creating three recursive ordering algorithms: MergeSort, BucketSort and QuickSort.

Notifications You must be signed in to change notification settings

PolPinol/Study-of-Recursive-Sorting-Algorithms

Folders and files

NameName
Last commit message
Last commit date

Latest commit

 

History

7 Commits
 
 
 
 
 
 
 
 
 
 
 
 

Repository files navigation

c

Study of Recursive Sorting Algorithms

Project to analyze, study and approve the recursive ordering algorithms studied in advanced programming class. These algorithms are Bucket Sort, Merge Sort and Quick Sort.

Language: Java

IDE: IntelliJ IDEA 2020.2.3 x64

Version: Java 15.0.1 (onpenjdk - 15 java version "15.0.1")

Compilation: Check that in 'Edit Configuration' -> 'Application' -> 'Main' -> 'VM options' contains '-ea' to accept assertions, followed by 'Build Project' with the class 'Main' as the main class.

Execution: 'Run' and to select the different options, interact with the Terminal. Enter the name of the dataset you want to analyze and once loaded select the different options available to view the rankings.

NOTE: As not specified in the statement, we assume that all data entered by the user they will be valid and therefore we do not control exceptions.



Hi 👋, I'm Pol Piñol Castuera

a graduate in mathematics and currently studying computer engineering.

About

Project that consists of creating three recursive ordering algorithms: MergeSort, BucketSort and QuickSort.

Resources

Stars

Watchers

Forks

Releases

No releases published

Packages

No packages published

Languages