This course covers the fundamental concepts of computer algorithms, including time and space complexity analysis, algorithm design techniques, and data structures. Students will learn how to develop efficient algorithms to solve complex problems and how to evaluate their performance. The course requires a strong background in mathematics and programming, and students can expect to spend a significant amount of time studying and practicing algorithms.
|
Case
|
Condition
|
Result
|
|
1
|
k < E
|
nᴱ
|
|
2
|
k == E
|
nᴷ lg(n)
|
|
3
|
k > E
|
nᴷ
|
|
For any prime p, for any x:
|
|
xᵖ ≡ x (mod p)
|
|
Alternatively, for any x ≠ 0:
|
|
xᵖ⁻¹ ≡ 1 (mod p)
|
|
(x + y) mod n = ((x mod n) + (y mod n)) mod n
|
|
(xy) mod n = ((x mod n) × (y mod n)) mod n
|
|
(x − y) mod n = ((x mod n) − (y mod n)) mod n
|
No comments yet.
Cheatography n. The art of mapping complex subjects into clear, instantly navigable reference guides.
