Computer science
Algorithms
Estimates of comparisons, operations and execution time.
Computer science
Linear search comparisons
Cworst = n→Computer scienceBinary search comparisons
Cworst = ⌈log₂(n+1)⌉→Computer scienceBubble sort comparisons
C = n(n−1)/2→Computer scienceOperation execution time
t = N / R→Computer sciencen log₂n estimate
C = n log₂n→Computer scienceLinear algorithm
C = c × n→Computer scienceQuadratic algorithm
C = c × n²→Computer scienceParallel speedup
S = T₁ / Tₚ→Computer scienceAmdahl's law
S = 1 / ((1 − p) + p/n)→Computer scienceParallel efficiency
E = S / n→Computer scienceHash table load factor
α = n / m→Computer scienceBalanced search tree height
h = log₂n→