Skip to main content

Bubble Sort- Basic Sorting Algorithm Using Java

/*
Bubble sort is a Comparison based sorting
Algorithm.
We Compare The Array Element With Next or
Previous Of Array Element . If The Element Is Higher Or
Lower Based on Our Requirement Swap Two.
    
*/
class Bubble{
public static void main(String[] args){
int[] arr={7,6,5,4,3,2,1};
int n=arr.length;
int swap=1;
int j=0;
while(swap>0){
swap=0;
for(int i=0;i<n-1;i++){
if(arr[i]>arr[i+1])
{
int temp=arr[i];
arr[i]=arr[i+1];
arr[i+1]=temp;
swap++;
}
}
}
for(int i=0;i<n;i++){
System.out.println(arr[i]);
}
}
}

output:
1
2
3
4
5
6
7

Comments

Popular posts from this blog

Class is a collection of similar objects. Which have common properties

Class is a collection of similar objects. Which have common properties. Syntax class class_name {        //member functions and variables. } How to create a objects for class class_name c=new class_name; We can access the member variable and member methods using dot operator. c.member_function(); Eg : class bike { void fun() { System.out.println("member method"); } public static void main(String[] args) { bike B=new bike(); B.fun(); } } output member method

Array - Java Programming

//Array Is a Basic Data Structure in Computer Programming. Array Have Continues Memory Allocation in Memory Space. Data Are Stored In Continues memory space . We Access Using the index Of The Element. Index Start From 0 to n-1 //Basic Operations in Array /* traverse search find insert Remove */ class array{ //Traverse A Array public static void traverse( int [] arr){ int n=arr.length; for ( int i= 0 ;i<n;i++){ System.out.println(arr[i]); } } //Find Value By Index public static void findByIndex( int [] arr, int index){ System.out.println(arr[index]); } //Find Index By Value public static void findIndex( int [] arr, int value){ int n=arr.length; for ( int i= 0 ;i<n;i++){ if (arr[i]==value){ System.out.println(i); } } } //Insert Function (Array Copy Method) public static void insert( int [] arr, int index, int v...