Sorting number using class and interface--

	import java.util.Scanner;
	interface Sorted{
	public void calculation(int num[],int n);
	}
	class SortingDemo implements Sorted{
	public void calculation(int num[],int n){
	int a,c;
	for(int i = 0; i<n-1; i++){
	for(int j = 0; j<n-1; j++){
	if(num[j] > num[j+1]){
	c=num[j];
	num[j] = num[j+1];
	num[j+1] = c;
	}
	}
	}
	System.out.println("sorting ");
	for(int p = 0; p <n; p++){
	System.out.println((p+1)+":"+num[p]);
	}
	}
	public static void main(String[] args) {
	Scanner sc = new Scanner(System.in);
	int num[] = new int[50];
	SortingDemo sendNum = new SortingDemo();
	int n;
	System.out.print("How many nmber input: ");
	n = sc. nextInt();
	for(int i = 0 ; i <n; i++){
	System.out.print(" input num "+(i+1)+":");
	num[i] = sc. nextInt();
	}
	sendNum.calculation(num,n);
	}
	}

view raw sorting.java hosted with ❤ by GitHub