포매터 및 코드
알고리즘 시각화 도구
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.
사람들이 다음도 검색합니다.
관련 도구