{% extends "base.html" %} {% block title %}Sorting | USSU Algorithm Analyzer v4.0{% endblock %} {% block content %}

Input Parameters

Algorithm Info

Merge Sort

O(n log n) O(n) Space Stable

Divide and conquer. Guaranteed n log n performance.

Quick Sort

O(n log n) avg O(log n) Space Unstable

In-place partition. Fastest in practice for large datasets.

Heap Sort

O(n log n) O(1) Space Unstable

In-place with heap structure. Guaranteed n log n.

{% if result %}

Result

Algorithm
{{ result.algorithm }}
Time (ms)
{{ "%.4f"|format(result.execution_time_ms) }}
Comparisons
{{ result.comparisons }}
Swaps
{{ result.swaps }}
Accesses
{{ result.accesses }}
Recursions
{{ result.recursions }}
Memory
{{ "%.2f"|format(result.memory_used_kb) }} KB
Elements
{{ result.sorted|length }}
{{ result.sorted[:50] }}{% if result.sorted|length > 50 %}... ({{ result.sorted|length }} elements){% endif %}
Time: {{ result.time_complexity }} Space: {{ result.space_complexity }} Stable: {{ "Yes" if result.stable else "No" }}

📊 Sorting Process Breakdown

Input Analysis

{{ result.algorithm }} received {{ result.sorted|length }} elements. Time complexity: {{ result.time_complexity }}. Space: {{ result.space_complexity }}.

Operation Count

{{ result.comparisons }} comparisons, {{ result.swaps }} swaps, {{ result.accesses }} accesses, {{ result.recursions }} recursive calls.

Output

Sorted in {{ "%.4f"|format(result.execution_time_ms) }}ms. Stability: {{ "Yes" if result.stable else "No" }}.

{% endif %} {% if step_images %}

Step-by-Step Visualization

{% for img in step_images %} Step {{ loop.index }} {% endfor %}
{% endif %} {% if compare_results %}

Comparison Results

{% for r in compare_results %} {% endfor %}
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 }}
{% endif %} {% endblock %} {% block extra_scripts %} {% endblock %}