Suppose an array has n elements. This _____ sorts to sort and array works as follows: Find the smallest element and place it in the first position. Then find the smallest of the remaining n-1 elements and place it in the second position. Repeat on n-2 elements, n-3 elements, ..., until the array is sorted.

Python Write a Python program that performs a linear (sequential) search. Define an array of 10 non-sequential numbers. Ask the user for a number, such as "Enter a number to be found:" Search the array for the user's number. If present, display "Successful search, the element is found at position " and its position. Otherwise, display "Number not found."

java - netbeans

Integer numElements is read from input and represents: • The number of elements in each array. The number of pairs of integers read from input. Declare two integer arrays, houselds and serviceCosts. Then, read each pair of integers from input. For each pair read, store the first integer into houselds and the second integer into serviceCosts. Ex: If the input is: 4 3 29 9 12 8 18 5 46 then the output is: House id: 3, Costs: $29 House id: 9, Costs: $12 House id: 8, Costs: $18 House id: 5, Costs: $46 1 import java.util.Scanner; 2 3 public class CashRecords { 4 5 16780 O 9 public static void main(String[] args) { Scanner scnr= new Scanner (System.in); int numElements; int i; numElements scnr. nextInt (); /* Your code goes here */ for (i = 0; i< numElements; ++i) { System.out.println("House id: + houseIds[i] + ", Costs: $" + serviceCosts [i]); 10 11 12 13 14 15 16 } 17 } }