- Исполнители
-
Обучение
Учебный центр Python Запускаемые примеры, NumPy, pandas и другое Учебный центр C и C++ Указатели, память, STL и современный C++ Учебный центр C#Основы C#, ООП, LINQ, async и упражнения .NET Алгоритмы на Python Поиск, сортировка, рекурсия и визуализация O(n) Алгоритмы на C и C++ Сравнение реализаций на C и C++
- Задачи
Visualizers
Sorting Algorithm Visualizer
See how classic sorting algorithms work, one comparison and swap at a time.
- Runs in your browser
- Instant results
- Free, no sign-up
Loading the tool…
How to use the Sorting Algorithm Visualizer
- Choose an algorithm, the number of elements and the starting data.
- Press Play, or Step to go one operation at a time.
- Compare comparisons, swaps and the complexity table between algorithms.
Frequently asked questions
Which sorting algorithm is fastest?
On random data, quick, merge and heap sort (O(n log n)) beat the O(n²) sorts. Insertion sort wins on nearly sorted data.
What does stable mean?
A stable sort keeps equal values in their original order, which matters when sorting records by one field.
Why try different starting data?
Some algorithms behave very differently on sorted, reversed or repetitive input; quick sort's worst case shows on sorted data.
Практикуйте Python на задачах
Решайте задачи прямо в редакторе: запускайте тесты, отправляйте решение и получайте AI-рецензию.