Skip to content

Sort an ArrayList of 100,000 random eight-digit numbers using either Merge sort, Quick sort, or the Built-in sort.

Notifications You must be signed in to change notification settings

AWilliamson88/Number-Sorter

Folders and files

NameName
Last commit message
Last commit date

Latest commit

 

History

12 Commits
 
 
 
 
 
 
 
 
 
 
 
 
 
 

Repository files navigation

Sorting Comparison

Compare three different sorting styles using a list of at least 100,000 whole numbers.

Made as part of a course to show understanding of certain course material & programming concepts.

Story

A company needs a new system to sort their payroll, and the ability to choose between three different sorting styles.

Features

  • Can sort a list of at least 100,000 random numbers from 1 to 10 million
  • Can sort using three different styles.
  • Sort methods are timed for comparison.

Project Requirements

  • Application creates lists of integers between 1 and 10 million.
  • The list must have at least 100,000 items.
  • Able to sort in three different styles with timers to indicate the speed at which this happens.
  • Use of a built-in sorting method is included.
  • Must use a comparator.
  • Other sorting methods must be written yourself.

Screenshots

Payroll sorter

Payroll sorter

Payroll sorter

About

Sort an ArrayList of 100,000 random eight-digit numbers using either Merge sort, Quick sort, or the Built-in sort.

Topics

Resources

Stars

Watchers

Forks

Releases

No releases published

Packages

No packages published

Languages