6
An algorithm is a step-by-step set of instructions or rules designed to solve a specific problem or perform a particular task. In computer science, algorithms are the foundation of all programs. They must be finite (have a clear end), definite (each step is precisely defined), and effective (each step can be performed). Common examples include sorting algorithms (like bubble sort, quick sort) and search algorithms (like binary search).
Log in to add a comment.