Linear Search: a linear search is a method for finding an element within a list. It sequentially checks each element of the list until a match is found or the whole list has been searched.
Brute Force:
A brute force algorithm is a rather straightforward approach to solving a problem. It is based on trial and error where the programmer tries to merely utilize the computer’s fast processing power to solve a problem, rather than applying some advanced algorithms and techniques developed with human intelligence. It is a naive approach adopted by most beginner programmers in the initial stages of solving a problem, however it might not be the most optimal approach, as it might increase both space and time complexity.
Insertion Sort:
Insertion sort is a simple sorting algorithm that builds the final sorted array or list one item at a time. It is much less efficient on large lists than more advanced algorithms such as quicksort, heapsort, or merge sort.