A sequential algorithm is a step-by-step procedure used to solve a problem or perform a task. It processes data in a specific order, executing one operation after another until the goal is achieved. This type of algorithm is straightforward and easy to follow, making it suitable for simple tasks like sorting a list or calculating a sum. In computer science, sequential algorithms are often contrasted with parallel algorithms, which can perform multiple operations simultaneously. Examples of sequential algorithms include bubble sort and linear search, both of which operate in a linear fashion, processing each element in a sequence.