4.2.1 Describe the characteristics of standard algorithms on linear arrays.

Sequential search - In order to find a certain number from a given array this search works by checking each component of the array sequentially
Binary Search - This search divides the array to two parts and checks whether the number we are looking for is higher or lower than the number in the middle of the array. The process continues until it finds the needed element.
Bubble Sort - Bubble sort works by comparing 2 elements next to each other. If the task is to put the array in an ascending order it will switch the places of the elements if the first one is higher than the one next to it. The process continues until the array is put in an ascending order.
Selection Sort -This type of sorting find the highest (or lowest) number from the array and puts it in the first place. Then it does the same by not taking into account the first element, and puts the next highest (lowest) at the second place. The process continues until the array is put in an ascending or descending order.