An algorithm is a finite, step-by-step
procedure that solves a problem or performs a
specific task, and is a core concept in
mathematics and computer science.
Key characteristics
Finiteness: A finite number of steps.
Input and output: Inputs and outputs are clearly defined.
Deterministic outcome: Each step is unambiguous, producing a deterministic outcome.
Types and construction
Divide and conquer: Divide-and-conquer (e.g., merge sort).
Greedy approach: Greedy (e.g., Huffman coding).
Dynamic programming: Dynamic programming (e.g., shortest paths).
Backtracking search: Backtracking (e.g., constraint satisfaction)
2026-08-06 01:17:24
0
To see more videos from user @criollannabgo, please go to the Tikwm
homepage.