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

For() - Basic Programming Concepts With psudo Code

for is an looping statement.it used to execute the tast until reach the condition. syntax for(installation,condition,increment or decrement) { //statements or block of code. } example, main() { int i; for(i=1;i<=10;i++) { printf("\n %d",i); } }

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

LPS(Longest Prefix Which Is Also Suffix) Array Generation Using Java

import java.util.* ; //Longest Prefix Which Is Also Suffix Which Is Used To Found a Pattern Through Avoid Repeated Characters in Given String. We Will Discuss KMP ALGORITHM TO Find A Pattern In Given String Latter. class lbs{ public static void main( String [] args){ Scanner in= new Scanner(System.in); //Get Input From User String s=in.nextLine(); //Convert String Into Char Array char [] ch=s.toCharArray(); int n=s.length(); int [] lbsArr= new int [n]; int j= 0 ,i= 1 ; lbsArr[ 0 ]= 0 ; //LPS ARRAY ALGORITHM /* i=1; j=0; string s="aaab" while i<n if s[i]==s[j]: lpsArr[i]=j; j=j+1 i=i+1 else: if j==0: lbsArr[j]=0 i=i+1 else: ...

javacpp

Search This Blog