package modules.iterative; public class SortModule { //TODO: Update/Complete the following bubbleSort algorithm // using for loops and swap method (see below) public static void bubbleSort(int[] data) { //TODO: Complete Body } //TODO: Update/Complete the following insertionSort algorithm // using for loops public static void insertionSort(int[] data) { //TODO: Complete Body } // This is an example of "finding the run time function" // for a maximum value algorithm public static int max(int[] data){ int n = data.length; // (1) data size int max = data[0]; // (1) // (1) for(int i = 0; i < n; i++) // n times // (1 + 1) if(max < data[i]) // (1) max = data[i]; // (1) // (1) terminates loop return max; // (1) // run time function f(n) = 1 + 1 + 1 + n(2 + 1 + 1) // f(n) = 4n + 5 } //TODO: Update/Complete the following selectionSort algorithm // using for loops and swap method (see below) public static void selectionSort(int[] data) { //TODO: Complete Body } //TODO: Update/Complete the following swap method public static void swap(int[] data, int a, int b) { //TODO: Complete Body } }