package
javaprgms;
import
java.util.Scanner;
class
BubbleSort {
@SuppressWarnings("resource")
public static void
main(String []args) {
int n, c, d, 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 (c =
0; c < n; c++)
array[c] = in.nextInt();
for (c =
0; c < ( n - 1 ); c++) {
for (d =
0; d < n - c - 1; d++) {
if (array[d]
> array[d+1]) /* For descending order use < */
{
swap = array[d];
array[d] = array[d+1];
array[d+1]
= swap;
}
}
}
System.out.println("Sorted
list of numbers");
for (c =
0; c < n; c++)
System.out.println(array[c]);
}
}
Output:
Input number of
integers to sort
5
Enter 5 integers
34
12
789
356
2
Sorted list of
numbers
2
12
34
356
789
No comments:
Post a Comment