Linear Search is a simple algorithm used to find a specific value in a list. It works by checking each element in the list one by one, starting from the first element and moving to the last. If the desired value is found, the search stops, and the position of the value is returned. If the value is not found after checking all elements, the algorithm indicates that the value is absent. This method is straightforward and easy to implement, but it can be inefficient for large lists. The time it takes to complete a Linear Search increases linearly with the number of elements, making it less suitable for large datasets compared to more advanced searching algorithms like Binary Search.