//This Java program depicts the use of Bubble

//sort technique to arrange the integers in

//an array in ascending order.

import java.util.*;

class bubbleSort

{

static void main()

{

Scanner sc=new Scanner(System.in);

System.out.println("Enter 10 numbers :-");

int a[]=new int[10];

int i;

for(i=0;i<10;i++)

{

a[i]=sc.nextInt(); //Accepting numbers

}

int min=0,j,k;

for(i=0;i<10;i++)

{

for(j=0;j<9-i;j++)

{

if(a[j]>a[j+1])

{

k=a[j];

a[j]=a[j+1];

a[j+1]=k;

}

}

}

for(i=0;i<10;i++)

{

System.out.println(a[i]); //Printing the numbers

}

}

}

//Author : Mayank Rajoria

//sort technique to arrange the integers in

//an array in ascending order.

import java.util.*;

class bubbleSort

{

static void main()

{

Scanner sc=new Scanner(System.in);

System.out.println("Enter 10 numbers :-");

int a[]=new int[10];

int i;

for(i=0;i<10;i++)

{

a[i]=sc.nextInt(); //Accepting numbers

}

int min=0,j,k;

for(i=0;i<10;i++)

{

for(j=0;j<9-i;j++)

{

if(a[j]>a[j+1])

{

k=a[j];

a[j]=a[j+1];

a[j+1]=k;

}

}

}

for(i=0;i<10;i++)

{

System.out.println(a[i]); //Printing the numbers

}

}

}

//Author : Mayank Rajoria

## No comments:

## Post a Comment