Search Results

6 results for “algorithm”

Formulae (6)

h = \left(q + \left\lfloor\tfrac{13(m+1)}{5}\right\rfloor + K + \left\lfloor\tfrac{K}{4}\right\rfloor + \left\lfloor\tfrac{J}{4}\right\rfloor + 5J\right) \bmod 7

Finds the day of the week for any Gregorian date.

d = (19a + b) \bmod 30,\quad a = y \bmod 19

Core step of the Gregorian algorithm locating the Paschal full moon.

\gcd(a,b) = \gcd(b, a \bmod b)

Recursively finds the greatest common divisor.

T(n) = aT(n/b) + f(n)

Analyzes running time of divide-and-conquer algorithms.

O(1) < O(\log n) < O(n) < O(n\log n) < O(n^2) < O(2^n)

Ordering of common algorithmic growth rates.

T(n) = aT(n/b) + f(n)

General form for analyzing divide-and-conquer recurrences.