Solve given example Find number is available or not in given array with the help of linar and binary search 35,63,62,83,78,12,21,74,99,56,45  Find number 78

operation of insertion-sort on the array A= {31,41,59,26,41,58}

Given this array: 1 2 4 5 6 7 8 12 14 21 22 42 53   How many comparisons are required to find 42 using the Binary Search? How many comparisons are required to find 42 using the Linear Search? How many comparisons are required to find an element that does not exist in array, using the Binary Search? How many comparisons are required to find an element that does not exist in array using the Linear Search? What is the largest number of comparisons needed to perform a binary search on an array with 42 elements?

Create an algorithm in inserting element in an array with 10 as its index size.

Check if Array with mean X can be made using N elements of given Array