Skip to main content

Bubble Sort Algorithm

 Bubble sort is one of the simplest sorting algorithms.  

 It is a comparison-based sorting algorithm.

 In this sorting algorithm, each pair of adjacent elements is compared and swapped if they are not in order.

 Disadvantage:-  

Not suitable for large data sets.

Average and worst-case complexity = O(n^2)


Normal code:-

 1
 2
 3
 4
 5
 6
 7
 8
 9
10
11
12
13
14
15
16
 public class BubbleSort{
    public static void main(String[] args){
        int[] arr = {3, 2, 5, 4, 7, 9, 1};
        for(int i=0; i<arr.length-1; i++){
            for(int j=0; j<arr.length-1-i; j++){
                if(arr[j]>arr[j+1]){
                    int temp = arr[j];
                    arr[j] = arr[j+1];
                    arr[j+1] = temp;
                }
            }
        }
        for(int x:arr)
            System.out.print(x+" ");
    }
 }

Optimize Code:-



 public class BubbleSort{
     public static void main(String []args){
        int[] arr = {3,2,5,4,7,9,1};
        for(int i=0; i<=arr.length-2; i++){
            boolean flag = false;
            for(int j=0; j<=arr.length-i-2; j++){
                if(arr[j]>arr[j+1]){
                    int temp = arr[j];
                    arr[j] = arr[j+1];
                    arr[j+1] = temp;
                    flag = true;
                }
            }
            if(flag==false)
               break;
        }
        for(int i:arr)
            System.out.print(i+" ");
     }
 }










































Popular posts from this blog



















Check whether a number is Seed of another number






















    A number P is said to be the seed of another number Q if multiplying     P with its digits equates to Q.      Ex:-  123 is seed of 738 as    123 * 1 * 2 * 3 = 738       Java   1  2  3  4  5  6  7  8  9 10 11 12 13 14 15 16 17 18 19  public  class  Seed{      public  static  void  main (String[]  args){          int  num1  =  123 ,  num2  =  738 ;          num1  =  Math. min (num1,num2);          num2  =  Math. max (num1,num2);          System. out . println (checkSeed(num1,  num2));      }      public  static  boolean  checkSeed ( int  num1,  int  num2){          int  seed  =  num1;          while (num1> 0 ){              seed  =  seed  *  (num1% 10 );              num1  =  num1  /  10 ;          }          if (seed==num2)               return  true ;          else               return  false ;      }   }      Python  def  checkSeed(num1,num2):      seed  =  num1      while  num1  >  0 :          seed  =  seed  *  (num1  %  10 )          num1  =  num1 // 10      if  seed == n




















Read more




























Program to sort the  first half of an array in ascending and second half in descending order






















     Ex:-  [2, 4, 3, 10, 5, 8] [2, 4, 3]  and [10, 5, 8] ====>  [2, 3, 4] ascending                                                              [10, 8, 5] descending [ 2, 3, 4, 10, 8, 5] is the required answer.  Java   1  2  3  4  5  6  7  8  9 10 11 12 13 14 15 16 17 18 19 20 21 22 23 24 25 26 27 28  public  class  ArraySort{      public  static  void  main (String[]  args){          int []  arr  =  { 2 ,  4 ,  3 ,  10 ,  5 ,  8 };          //sorting first half in ascending order          for ( int  i= 0 ;  i<(arr. length / 2 );  i++){              for ( int  j=i+ 1 ;  j<(arr. length / 2 );  j++){                  if (arr[i]>arr[j]){                      int  temp  =  arr[i];                      arr[i]  =  arr[j];                      arr[j]  =  temp;                  }              }          }          //sorting second half in descending order          for ( int  i=(arr. length / 2 );  i<arr. length ;  i++){              for ( int  j=i+ 1 ;  j<arr. length ;  j++)




















Read more




























Write a method to move hyphens to the left and characters to the right in a string






















    Ex:-     code--heist--   ==>       ----codeheist     Note:-  Return null or None if str is empty.   Java   1  2  3  4  5  6  7  8  9 10 11 12 13 14 15 16  public  static  String  moveHyphens (String  str)    {      if (str. length ()== 0 )          return  null ;      else {          String  result  =  "" ;          for ( int  i= 0 ;  i<str. length ();  i++){              char  ch  =  str. charAt (i);              if (ch== '-' )                  result  =  ch  +  result;              else                  result  +=  ch;          }          return  result;      }   }      Python  def  moveHyphens (str):      if  len(str)== 0 :          return  None      else :          result  =  ""          for  char  in  str:              if  char== '-' :                  result  =  char  +  result;              else :                  result  +=  char          return  result      




















Read more