Skip to content

المنسقات والكود

مرئي الخوارزميات

Step through sorts and pathfinding visually.

Runs in your browser

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.

يبحث الأشخاص أيضًا عن

أدوات ذات صلة

More in this room.

شاهد الكل في المنسقات والكود