Linear Search: In computer science, a linear search or sequential 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 : In computer science, brute-force search or exhaustive search, also known as generate and test, is a very general problem-solving technique and algorithmic paradigm that consists of systematically enumerating all possible candidates for the solution and checking whether each candidate satisfies the problem's statement. 

 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.