Write a program that counts the number of basic steps needed for sorting an array of integer numbers. Implement the Selection Sort algorithm, and the Insertion Sort algorithm (and as challenge: the BubbleSort algorithm). Use the following methods: public static void insertionSort(int array[]) and public static void selectionSort(int array[]). Challenge: public static void bubbleSort(int array[]). Each method sorts the array given as parameter. It also counts and prints the number of comparison steps and the number of swap operations needed. You may re-use your code from the previous lab.

Please help with this java problem

The programming language used is Java

Write a Java method (do not write a class, only the method) with the following signature: Return type: void Parameters: 2D integer array Name: printDiagonal Implement the method code that will print out the values of the 2D array along the Diagonal from left to right. For example, if the array had the following values: 56    78    98 21    33    55 98    44    11        The method should print to the console:   56,33,11 The above 2D array example is only given for you to understand the problem Do not hard code the values in your solution or assume the array is the same as the given data. Your method should work for all 2D integer arrays.

Java

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

Java

2. Write a method that takes a rectangular two-dimensional array of type int and returns a valu of type int. The method returns the number of rows with negative sum. A row has a negative s if the sum of all its elements is less than 0. public static int countNegativeSum(int[][] in) Taken array Result 1 -3 17 -5 -5 14 -5 -2 30 -19 -8 -8 1 1 3 -1 -4 78 8 -3 -5 -1 -1 3 -4