⚔️ Best/Average/Worst Case Arena

Compare algorithm performance across different input scenarios!

📊 Case Comparison

🏆

BEST CASE

Input already in ideal state for the algorithm

Steps

Complexity

📊

AVERAGE CASE

Random, typical input distribution

Steps

Complexity

💀

WORST CASE

Input that causes maximum operations

Steps

Complexity

🔬 Run Experiment

Linear Search

Binary Search

Bubble Sort

Quick Sort

🏆 Best Case

Target at start

📊 Average Case

Random position

💀 Worst Case

Target at end

Array (N = 16) | Target: -

Array Size (N)

Animation Speed

📈 Results Comparison

Steps Comparison

Best

Average

Worst

Algorithm Info

Linear Search:

• Best: O(1) - Found at first position

• Average: O(N/2) ≈ O(N)

• Worst: O(N) - Found at last or not found

The same algorithm can have different performance depending on input:

Algorithm	Best	Average	Worst
Linear Search	O(1)	O(N)	O(N)
Binary Search	O(1)	O(log N)	O(log N)
Bubble Sort	O(N)	O(N²)	O(N²)
Quick Sort	O(N log N)	O(N log N)	O(N²)