Sorting Identifier Lab | Champak Roy

A beginner-friendly tool: paste number lines and discover which sorting method the steps look like. Start with Bubble, Selection and Insertion. Then try Quick Sort, Merge Sort, Heap Sort and Counting Sort.

1. Write numbers
First line is the original list.

2. Add next lines
Each next line is after one sorting pass.

3. Click Check
The page tells you the most likely sort.

Choose a ready example

Or make a new practice question

Input format: one line at a time. No words like Start or Pass are needed.

Answer

Waiting...

Match Scores

Picture of Each Line

Line-by-Line Check

Practice: What Comes Next?

Choose a sort, see the first line, then write what the next line should be.

Ready Examples

Beginner Help

Sorts used here

Bubble Sort Selection Sort Insertion Sort Quick Sort Merge Sort Heap Sort Counting Sort

How to write the lines

5,1,4,2,8
1,4,2,5,8
1,2,4,5,8

First line is the starting array. Every next line is the array after one visible step or pass.

Important note

Use one plain number list per line. No labels are needed. Example: 9,7,3,1 then next line 7,3,1,9.

Basic sorts are best for beginners. Advanced sorts may have different styles of steps. Here we use one simple classroom style for each: Quick Sort shows each pivot placement, Merge Sort shows each merge round, Heap Sort shows heap/extract steps, and Counting Sort shows the output being rebuilt.