Java Implementation for Sortings:
Bubble Sort:
import java.util.Scanner;
public class BubbleSort {
public static void main(String[] args) {
Scanner scan = new Scanner(System.in);
System.out.println("input size");
int n = scan.nextInt();
int[] ar = new int[n];
System.out.println("input elements");
for (int i = 0; i < ar.length; i++) {
ar[i] = scan.nextInt();
}
bubbleSort(ar);
for (int i = 0; i < ar.length; i++) {
System.out.print(ar[i]+"\t");
}
System.out.println();
scan.close();
}
private static void bubbleSort(int[] ar) {
// TODO Auto-generated method stub
int temp = 0;
for (int i = 0; i < ar.length; i++) {
for (int j = 1; j < (ar.length-i); j++) {
if(ar[j-1]>ar[j]){
temp = ar[j-1];
ar[j-1] = ar[j];
ar[j] = temp;
}
}
}
}
}
Insertion Sort:
import java.util.Scanner;
public class InsertionSort {
public static void main(String[] args) {
Scanner scan = new Scanner(System.in);
System.out.println("input size");
int n = scan.nextInt();
int[] ar = new int[n];
System.out.println("input elements");
for (int i = 0; i < ar.length; i++) {
ar[i] = scan.nextInt();
}
insertionSort(ar);
for (int i = 0; i < ar.length; i++) {
System.out.print(ar[i]+"\t");
}
System.out.println();
scan.close();
}
private static void insertionSort(int[] ar) {
int key,j;
for (int i = 1; i < ar.length; i++) {
key = ar[i];
j=i-1;
while(j>=0 && ar[j]>key){
ar[j+1] = ar[j];
j--;
}
ar[j+1] = key;
}
}
}
