ソート勉強・実行ツール

Description

【Overview】
An app for studying and practicing sorting.
It will tell you the process and the number of comparisons along the way.
If you are studying sorting algorithms or want to know the actual number of comparisons, please use it!
The possible sorting algorithms are:
・Selection sort (basic selection method, simple selection method, selection sort)
・Bubble sort (simple exchange method, bubble sort)
・Insertion sort (basic insertion method, simple insertion method, insertion sort)
・quick sort
・Merge sort
・heap sort
・Shell sort

[App function]
◆ Data generation
Randomly generate the data (sequence) used for sorting with a simple operation.
You can specify the number of data and data content.
"You can generate up to 10,000 pieces of data!"

◆ Display of intermediate sorting process
　Displays the intermediate process of sorting.
"It's perfect for studying because it carefully teaches you from the start of sorting to the completion of sorting."
　Since it is displayed as a still image, the overall flow can be understood at a glance.
"If you don't like studying from a textbook, try using it."
You can specify and execute your favorite data, so you can study in a hands-on format!

◆ Display of number of comparisons
"Displays the number of comparisons during sorting."
The number of comparisons is an important factor in considering the efficiency of sorting.
"I want to know the fastest sort!"
"I want to study sorting deeply!"
"Is it really O(n^2) or O(n log n)?"
"I want to use an actual formula instead of O(...) for the number of comparisons!"
"If that's the case, please use it!"

[Advantages of the app]
・Since the sorting process is displayed as a still image, the overall flow is easy to understand.
→ Useful for studying sorting algorithms!
・A large amount of data can be generated with simple operations.
→ Saves the trouble of manually entering data!
・It will tell you the number of comparisons when sorting.
→ It is also useful for sorting algorithm research!
・A wide variety of sorting algorithms are supported. (Supports selection sort, bubble sort, insertion sort, quick sort, merge sort, heap sort, and shell sort.)
→ You can study many sorting algorithms!

Deepen your understanding of sorting algorithms with this app!


【Instructions】
Summarize the details of functions and operation methods.
◆ Data generation
Data used for sorting can be randomly generated.
(1) Enter the number of data you want to generate to the right of "Number of data".
You can easily change the number of data by pressing buttons such as "-1" and "+1".
(2) Select "Yes" or "No" for "Duplicate Data".
If yes, the same data may be generated multiple times like 1, 2, 3, 1, ….
(3) Click the "Generate data" button.
　　Data is generated randomly.
If the number of data is 10 or less, it will be displayed directly below the "Generate data" button.
If it is 11 or higher, it will be displayed at the bottom of the screen.

◆ Data specification
You can specify the data content to use for sorting.
You can also make some changes after generating the above data.
(1) Enter data from 0 to 9 in the input field directly below "Generate data".
There are 10 input fields.
Leave blank when reducing the number of data.

◆Sort execution
Execute sorting and display the intermediate process and the number of comparisons.
(1) Prepare the data to be used by generating the above data or specifying the data.
(2) Select "Use upper data" or "Use lower data".
　　If you select "Use the data above", the intermediate process of sorting will be displayed.
(3) "selection sort", "bubble sort", "insertion sort", "quick sort", "merge
　　Press either "sort", "heap sort" or "shell sort".
The intermediate process of sorting and the number of comparisons are displayed.
Below is an overview of each sort.
・Selective sort
Also known as: basic selection method, simple selection method, selection sort
　Find the minimum (or maximum) value from the unsorted data and move it to the sorted part.
When searching for the minimum value, data movement is not performed.
・Bubble sort
　Alternative name: simple exchange method, bubble sort
　Find the minimum (or maximum) value from the unsorted data and move it to the sorted part.
When searching for the minimum value, move the data.
・Insertion sort
　Alternative names: basic insertion method, simple insertion method, insertion sort
The unsorted data is sequentially moved to the sorted part.
・Quick Sort
　Alternative name: quick sort
With the central data as the axis, other data are moved to the left and right of the axis according to the size relationship with the axis.
　Repeat until the entire data is sorted.
・Merge sort
Also known as: merge sort
Group the data and merge it with the adjacent groups.
At this time, merge so that each group is already sorted.
Repeat until all groups are merged.
・Heapsort
Also known as: heap sort
Convert the entire data into a tree structure.
Sort the data so that the parent is smaller (or larger) than the child. (Generate heap.)
After generating the heap, move the root data to the sorted array.
Move the leaf data to the root and rearrange the data to regenerate the heap.
Repeat until all data is moved to the sorted array.
・Shell Sort
　Alias: Shell sort
Group the entire data at equal intervals. (The interval is half the number of data.)
Insertion sort is performed within each group.
After that, halve the grouping interval and perform insertion sort again within each group.
Repeat until there is only one group.