Question

mplement the following searching and sorting algorithms and show the results. Describe algorithms efficiency using Big O notations for insertion sort

make a very simple algorithm please

IN JAVA PLEASE

Answer 1

/**
* Insertion Sort - BigO(n^2)
*/
public class InsertionSortChegg {
public static void insertionSort(int array[]) {
int number = array.length;
for (int j = 1; j < number; j++) {
int key = array[j];
int i = j-1;
while ( (i > -1) && ( array [i] > key ) ) {
array [i+1] = array [i];
i--;
}
array[i+1] = key;
}
}

public static void main(String ar[]){
int[] arr = {6,12,1,5,82,111,68,92};
System.out.println("Before Insertion Sort");
for(int i:arr){
System.out.print(i+" ");
}
System.out.println();
  
insertionSort(arr);//sorting array using insertion sort

System.out.println("After Insertion Sort");
for(int i:arr){
System.out.print(i+" ");
}
}
}

//////PLEASE GIVE A THUMBS UP!!!!!!!!