Write a Java program to sort an array of given integers using Selection Sort Algorithm.

Below is a bubble sort program that sorts the elements in an array. static void bubbleSort(int] arr) { arr.length; int temp = 0; for (int i = 0; i arrlil) { int n = temp arrlj- 1 arrlj - 1] = arrlil: arrli] = temp; Based on the program above, please draw a control flow graph for it. In your control flow graph, what are the test requirements for edge coverage List test path(s) that achieves the edge coverage. Provide test cases for each test path you list in the previous question. If it is not possible to find the test input for certain test path, describe the reason. In your control flow graph, what are the test requirements for edge-pair coverage? List test paths that achieve the edge-pair coverage Provide test cases for each test path you list in the previous question. If it is not possible to find the test input for certain test path, describe the reason.

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 program to sort an array of random elements using quicksort as follows: Sort the arrays using pivot as the first element of the array Sort the arrays using pivot as the median of the first, last, and middle elements of the array Sort the arrays using pivot as the first element of the array. However,, when the size of any sub-list reduces to less than 20, sort the sub-list using insertion sort. Sort the array using pivot as the median of the first, last and middle elements of the array. When the size of any sub-list reduces to less than 20, sort the sub-list using insertion sort. Calculate and display the CPU time for each of the preceding four steps. Example of the median of the first, last and middle elements: 1 2 3 4 5 6 7 8 0 (median of 1, 5, 0 is 1) 8 0 1 2 3 4 5 6 7 (median of 8, 3, 7 is 7) To calculate the CPU time, use the header , and clock_t type. You need to cast the duration to float and divide it by CLOCKS_PER_SEC. Depends on the CPU of your computer, your…