Write a Java program to take input an integer n which is the size of an array and then take input n different integers which are the values of the array. Then check whether 1 appears in first or last position of the array. Given: n>=1

Write a Java program that inputs size of array N and N numbers in the array. It should use Insertion sort to sort the array and then display it. Then, ask a number X to search in the array. It should use Binary search and then print the result of search.     Searching and Sorting Algorithms   Enter size of array ? 5   Enter 5 numbers : 5.5 8.2 2.4 9.1 3.3   Sorted array:  2.4,  3.3,  5.5,  8.2,  9.1   Enter a number to search ?   8.2   8.2 Found at index 3

Write a python program to print the prime numbers existing in an array. For instance, if A = [4, 7, 12, 3, 9], the output should be 7, 3.

CAN THIS PLEASE BE DONE In PYTHON? Input a list of employee names and salaries and store them in parallel arrays.  End the input with a sentinel value. The salaries should be floating point numbers  Salaries should be input in even hundreds.  For example, a salary of 36,510 should be input as 36.5 and a salary of 69,030 should be entered as 69.0. Find the average of all the salaries of the employees.  Then find the names and salaries of any employee who's salary is within 5,000 of the average.  So if the average is 30,000 and an employee earns 33,000, his/her name would be found.  Display the following using proper labels.    Save your file using the naming format  LASTNAME_FIRSTNAME_M08 FE.  Turn in your file by clicking on the Start Here button in the upper right corner of your screen.     1.Display the names and salaries of all the employees.  2. Display the average of all the salaries 3. Display all employees that are within 5,000 range of the average.

Write a program to accept 10 positive and negative values in an integer array. Program would shift all negative values to the left side and all positive values to the right side of the array without sorting them. Use Java coding Language.

Write a program that reads a list of integers from input into an array and outputs "yes" if the list is sorted in ascending order between two provided positions. Otherwise, output "no". The first input specifies the number of items in the list. The next set of inputs is the list. The last two inputs are the start and end positions (inclusive). Assume the list contains less than 20 integers and position 1 is the first element. Ex: If the input is: 8 5 6 7 4 3 2 1 0 1 3 the output is: yes Ex: If the input is: 6 1 2 3 4 5 2 4 6 the output is: no

Write a Java program that reads an integer N from the user and declares an integer array of size N. It then inputs N non-negative integers from the user into the array and do the following: 1. Finds and prints the minimum, maximum, sum, and average of the numbers. 2. Displays array data as a histogram – graphically by plotting each numeric value as a bar of asterisks (+) as shown in the example diagram. This is somehow similar to Lab11 Sample output Enter the size of array: 9 Enter 9 integer values: 10 19 5 14 Minimum = Maximum = 19 = 68 = 7.55 Sum Average ========== Histogram: ======= Element Ua lue 10 19 Histogran T T T Arial v T = ABC 3 (12pt) II Com