Linear vs Binary search - Create a sorted list of 100 random integers. - Prompt the user for an integer to find We will assume the number will be in the list - Find the value using linear and binary search methods - Display how many iterations it took each algorithm to find the value. - Continue until the program is halted. 1) Linear (brute force): this algorithm will start at the beginning of the list and examine each integer in sequential order until the value is found Linear Search Algorithm Step 1: First, read the search element (Target element) in the array. Step 2: In the second step compare the search element with the first element in the array. Step 3: If both are matched, display "Target element is found" and terminate the Linear Search function. Step 4:1f both are not matched, compare the search element with the next element in the array. Step 5: In this step, repeat steps 3 and 4 untit the search (Target) element is compared with the last element of the array. Step 6 - It the last element in the list does not match, the Linear Search Function will be terminated, and the message "Element is not tound" will be displayed. 2) Binary Recursive: this algorithm divided the list in two. Checks to see if the mid-point is the value. Continues to divide the remainder of the list checking the mid-point until the value is found..

1. Match each example to the corresponding type of state power. Large GDP (Gross Domestic
Product) 1 million acres of arable land Highly functional government with low levels 1. Natural
source of power of corruption 2. Tangible source of power (hard President with visionary power)
leadership skills 3. Intangible source of power Advanced transportation. network (ports,
highways, and airports) Highly educated and healthy population