{% extends "base.html" %} {% block title %}Benchmark Suite | USSU Algorithm Analyzer v4.0{% endblock %} {% block content %}
Cross-size performance profiling with statistical analysis and scaling charts.
Compare searching algorithms across array sizes 100 to 10,000 with statistical profiling.
Cross-size scaling analysis from 100 to 2,000 elements. Slow algorithms skipped for large inputs.
Random graph generation with varying vertex counts. Measures traversal and shortest path performance.
| Size | {% for key in first.times.keys() %}{{ key }} | {% endfor %}
|---|---|
| {{ r.size }} | {% for key in r.times.keys() %}{% set val = r.times[key] %} {% if val is number %} {% if val > 999999 %} Skipped {% else %} {{ "%.4f"|format(val) }} {% endif %} {% else %} {{ val }} {% endif %} | {% endfor %}
| Size | BFS (ms) | DFS (ms) | Dijkstra (ms) |
|---|---|---|---|
| {{ r.size }} | {{ "%.4f"|format(r.bfs) }} | {{ "%.4f"|format(r.dfs) }} | {{ "%.4f"|format(r.dijkstra) }} |
| Size | Knapsack (ms) | LCS (ms) |
|---|---|---|
| {{ r.size }} | {{ "%.4f"|format(r.knapsack) }} | {{ "%.4f"|format(r.lcs) }} |