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

🔍 SEARCHING ALGORITHMS

8 searching algorithms with complexity tracking and benchmark comparison.

Input Parameters

Algorithm Info

Linear Search

O(n) O(1) Space

Sequential scan through array. No sorting required.

Binary Search

O(log n) O(1) Space Requires Sorted

Divide search space in half each iteration.

Jump Search

O(√n) O(1) Space

Jump ahead by √n steps, then linear search backward.

{% if result %}

Result

Algorithm
{{ result.algorithm }}
Found
{% if result.found %}Yes{% else %}No{% endif %}
Index
{{ result.index }}
Time (ms)
{{ "%.4f"|format(result.execution_time_ms) }}
Comparisons
{{ result.comparisons }}
Accesses
{{ result.accesses }}
Recursions
{{ result.recursions }}
Memory
{{ "%.2f"|format(result.memory_used_kb) }} KB
{{ result.time_complexity }} {{ result.space_complexity }} Array Size: {{ result.array_size }} Target: {{ result.target }}

🔍 Search Process Visualization

Initialization

Array size: {{ result.array_size }} elements. Target: {{ result.target }}. Algorithm: {{ result.algorithm }}.

Execution

Performed {{ result.comparisons }} comparisons and {{ result.accesses }} array accesses across {{ result.recursions }} recursive calls.

Result

Target {{ "found" if result.found else "not found" }} at index {{ result.index }}. Time complexity: {{ result.time_complexity }}. Space: {{ result.space_complexity }}.

{% endif %} {% if compare_results %}

Comparison Results

{% for r in compare_results %} {% endfor %}
Algorithm Time (ms) Found Index Comparisons Complexity
{{ r.name }} {{ "%.6f"|format(r.time_ms) }} {{ "Yes" if r.found else "No" }} {{ r.index }} {{ r.comparisons }} {{ r.complexity }}
{% endif %} {% endblock %}