Simply-divine / ShellSort-Experiment Public

Notifications You must be signed in to change notification settings
Fork 0
Star 4

Finding time taken by different h-sorted arrays

4 stars 0 forks Branches Tags Activity

Notifications

Name		Name	Last commit message	Last commit date
Latest commit History 7 Commits
ShellSort		ShellSort
LICENSE		LICENSE
README.md		README.md

Repository files navigation

ShellSort

Aim:

To find the time taken for Shell sort algorithm using different h-sorted arrays.

Following sorts can be analyzed:

Powers Of Two: 1,2,4,8,16,...
Powers Of Two Minus One: 1,3,7,15,...
Knuth Sequence: 1,4,7,10...

About

Finding time taken by different h-sorted arrays

sorts shellsort

Report repository

Releases

No releases published

Packages

No packages published

Languages

Java 100.0%