Skip to content

An interactive program that includes heap sorting, bubble sorting, simple selection sorting, Radix sorting, quick sorting, Shell sorting, and it can calculate sort time

Notifications You must be signed in to change notification settings

BetterLevi/Integrated-sorting-process

Folders and files

NameName
Last commit message
Last commit date

Latest commit

 

History

2 Commits
 
 
 
 

Repository files navigation

#Integrated-sorting-process this program contains six kinds of sorting: Bubble_sort,Heap_Sort,Radix_Sort,Shell_Sort,SampleSelect_Sort and Quick_Sort. It can calculate the time of sorting by using System.nanoTime(), and also,this program can draw a line chart to compare the time of the defferent sort methods.

you can input the quantity of number and the program will generate random data between 1~10000 automatically

About

An interactive program that includes heap sorting, bubble sorting, simple selection sorting, Radix sorting, quick sorting, Shell sorting, and it can calculate sort time

Resources

Stars

Watchers

Forks

Releases

No releases published

Packages

No packages published

Languages