Skip to content

Sorting Visualiser is an application that allows to visualize the operation of various implemented sorting algorithms.

Notifications You must be signed in to change notification settings

DKrakowczyk/SortingVisualiser

Folders and files

NameName
Last commit message
Last commit date

Latest commit

 

History

13 Commits
 
 
 
 
 
 
 
 
 
 

Repository files navigation

Sorting Visualiser

JAVA SWING

Sorting Visualiser is an application that allows to visualize the operation of various implemented sorting algorithms. List of available algorithms:

  • Bubble sort (1)
  • Coctail sort (2)
  • Comb sort (3)
  • Quick sort (4)
  • Insertion sort (5)
  • Radix sort (6)
  • Shell sort (7)
  • Pigeonhole sort (8)

How to use

By default, after starting the program, all array elements are sorted in ascending order. All operations are performed on a set consisting of 500 elements. To expand the context menu, press the m button

Algorithms

Fisher-Yates shuffling algorithm

To shuffle all the items in the array , press the 0 button. shuffling

Bubble sort

To run Bubble sort , press the 1 button.

bubble sort

Coctail sort

To run Coctail sort , press the 2 button.

Coctail sort

Comb sort

To run Comb sort , press the 3 button.

Comb sort

Quick sort

To run Quick sort , press the 4 button.

Quick sort

Insertion sort

To run Insertion sort , press the 5 button.

Insertion sort

Radix sort

To run Radix sort , press the 6 button.

Radix sort

Shell sort

To run Shell sort , press the 7 button.

Shell sort

Pigeonhole sort

To run Pigeonhole sort , press the 8 button.

Pigeonhole sort

The speed of operation of individual algorithms has been adjusted in order to best illustrate how do they work.

About

Sorting Visualiser is an application that allows to visualize the operation of various implemented sorting algorithms.

Topics

Resources

Stars

Watchers

Forks

Releases

No releases published

Packages

No packages published

Languages