Bubble Sort
Example
package com.naresh.sort;
import
java.util.Scanner;
public class BubbleSort
{
public static void main(String[]
args) {
int n, i, j, swap;
Scanner in = new
Scanner(System.in);
System.out.println("Input
number of integers to sort");
n = in.nextInt();
int array[] = new int[n];
System.out.println("Enter
" + n + " integers");
for (i = 0; i <
n; i++) {
array[i] = in.nextInt();
}
for (i = 0; i < (n - 1); i++) {
for (j = 0; j <
n - i - 1; j++) {
if (array[j] >
array[j + 1])
{
swap =
array[j];
array[j] =
array[j + 1];
array[j + 1]
= swap;
}
}
}
System.out.println("Sorted
list of numbers");
for (i = 0; i <
n; i++) {
System.out.println(array[i]);
}
}
}
Insertion Sort Example
package com.naresh.sort;
public class InsertionSort {
public static void main(String[]
args) {
int[] array = { 6,
5, 8, 1, 4, 7, 3, 2 };
for (int a = 1; a <
array.length; a++) {
for (int n = 0; n <
a; n++) {
if (array[a] <
array[n]) {
int swap =
array[a];
array[a] =
array[n];
array[n] = swap;
}
}
}
for (int m = 0; m <
array.length; m++) {
System.out.print(array[m]
+ "
");
}
}
}
Selection Sort Example
package com.naresh.sort;
public class SelectionSort {
public static void main(String[]
args) {
int[] array = { 6,
5, 8, 1, 4, 7, 3, 2 };
int swap, min;
for (int a = 0; a <
array.length - 1; a++) {
min = a;
for (int n = a + 1; n
< array.length; n++) {
if (array[n] <
array[min]) {
min = n;
}
}
swap = array[min];
array[min] = array[a];
array[a] = swap;
}
for (int m = 0; m <
array.length; m++) {
System.out.print(array[m]
+ "
");
}
}
}
No comments:
Post a Comment