Frequently Asked Questions

Pick an algorithm and press play; the tool animates an array of bars, highlighting each comparison and swap as the algorithm sorts them, so you can watch exactly how it reorders the data.

Yes, it's completely free with no sign-up, downloads, or limits. Run as many visualisations as you like.

It covers the common ones taught in computer science: bubble sort, selection sort, insertion sort, merge sort, quick sort, and heap sort.

Yes. You can adjust the animation speed (1 = slowest to 5 = fastest) and the number of bars (5 to 100), and generate a fresh random array whenever you like, so you can slow things down to follow each step or speed through a large array.

Yes. Alongside play and pause, you can use the Step button to advance through the algorithm one operation at a time — useful for studying each individual comparison and swap closely.

Yes. Each algorithm card below the visualizer shows its best, average, and worst-case time complexity (Big-O) and whether it is stable, so you can connect what you see to how efficiently the algorithm performs in different scenarios.

Different algorithms do different amounts of work. For example, bubble sort makes many comparisons and swaps (O(n²) on average), while merge sort and quick sort are generally far more efficient (around O(n log n)). The visualizer makes that difference visible — try the same array with bubble sort and merge sort and watch the step counter.

No. Everything runs directly in your browser — the arrays are generated and sorted locally. Nothing is sent to a server or stored anywhere.

Yes, the tool is fully responsive and the visualisation scales to fit smartphones, tablets, and desktops without overflowing the screen. On small screens, the default array size is reduced automatically so the bars remain readable.

Yes — it's built to be a clear learning aid for students, teachers, and anyone studying algorithms. Feel free to link to it from your notes, lessons, blog posts, or course materials.