格式化与代码
算法可视化工具
Step through sorts and pathfinding visually.
Click Visualise to step through the algorithm.
编辑注
Understanding · Step through the algorithm, watch the invariant.
本深度章节目前仅有英文版本。上方的转换工具支持您的语言;长篇说明文章尚未翻译。
常见问题
Quick answers.
›Which algorithms are supported?
The tool visualises common sorting algorithms like QuickSort and MergeSort, as well as pathfinding algorithms such as Dijkstra's and A* Search.
›Can I adjust the animation speed?
Yes. Use the speed slider to slow down the execution for step-by-step analysis or speed it up to see the final resulting state quickly.
›What data sets can I use?
You can choose between randomly generated arrays, nearly sorted data, or custom inputs to see how different algorithms handle specific edge cases.
›Is the visualisation accurate to real-world code?
The logic follows standard algorithmic implementations. While the visualisations include artificial delays for clarity, the sequence of operations matches how these algorithms function in software libraries.
大家也在搜索
相关工具