{% extends "base.html" %} {% block title %}Sorting | USSU Algorithm Analyzer v4.0{% endblock %} {% block content %}
13 sorting algorithms with step-by-step visualization and performance metrics.
Divide and conquer. Guaranteed n log n performance.
In-place partition. Fastest in practice for large datasets.
In-place with heap structure. Guaranteed n log n.
{{ result.algorithm }} received {{ result.sorted|length }} elements. Time complexity: {{ result.time_complexity }}. Space: {{ result.space_complexity }}.
{{ result.comparisons }} comparisons, {{ result.swaps }} swaps, {{ result.accesses }} accesses, {{ result.recursions }} recursive calls.
Sorted in {{ "%.4f"|format(result.execution_time_ms) }}ms. Stability: {{ "Yes" if result.stable else "No" }}.
| Algorithm | Time (ms) | Complexity | Space | Stable | Comparisons |
|---|---|---|---|---|---|
| {{ r.name }} | {% if r.time_ms is number and r.time_ms < 999999 %}{{ "%.4f"|format(r.time_ms) }}{% else %}Skipped{% endif %} | {{ r.complexity }} | {{ r.space }} | {{ r.stable }} | {{ r.comparisons }} |