Sorting in Java | Bubble Sort Algorithm | Java Placement Course 16

Sorting in JAVA

1. Bubble Sort

Bubble Sort is a simple sorting algorithm that works by repeatedly swapping adjacent elements if they are in the wrong order. It gets its name from the way the smaller elements "bubble" to the top of the list. Here is the basic algorithm:

1) Start with an unsorted list of n elements

2) Loop through the list n-1 times (the outer loop).

3) For each iteration of the outer loop, loop through the unsorted portion of the list (the inner loop).

4) Compare each adjacent pair of elements. If they are in the wrong order, swap them.

5) After each iteration of the inner loop, the largest element in the unsorted portion of the list will "bubble up" to the end of the list.

6) After the outer loop has finished, the list will be sorted.

Idea: if arr[i] > arr[i+1] swap them. To place the element in their respective position, we have to do the following operation N-1 times. 

Time Complexity: O(N2)

Code

import java.util.*;

s 

class Sorting {

   public static void printArray(int arr[]) {

       for(int i=0; i<arr.length; i++) {

           System.out.print(arr[i]+" ");

       }

       System.out.println();

   }

 

   public static void main(String args[]) {

       int arr[] = {7, 8, 1, 3, 2};

 

       //bubble sort

       for(int i=0; i<arr.length-1; i++) {

           for(int j=0; j<arr.length-i-1; j++) {

               if(arr[j] > arr[j+1]) {

                   //swap

                   int temp = arr[j];

                   arr[j] = arr[j+1];

                   arr[j+1] = temp;

               }

           }

       }

 

       printArray(arr);

   }

}

Sure! Here's an implementation of the Bubble Sort algorithm in Java:

css
public static void bubbleSort(int[] arr) {
 int n = arr.length; 
 for (int i = 0; i < n - 1; i++) {
 for (int j = 0; j < n - i - 1; j++)
 {
            if (arr[j] > arr[j+1]) {
                // Swap arr[j] and arr[j+1] 
 int temp = arr[j]; 
 arr[j] = arr[j+1]; 
 arr[j+1] = temp;
            } 
 }
 }
 }

In this implementation, arr is the unsorted array, n is the length of the array, and i and j are loop variables. The inner loop (for j) compares adjacent elements and swaps them if necessary. The outer loop (for i) controls how many times the inner loop should be executed.

To use this method, you can simply call it with your array as an argument:

int[] arr = {5, 2, 8, 3, 1, 6}; bubbleSort(arr);

After the method returns, arr will be sorted in ascending order.

Note that, like the Python implementation, this implementation of Bubble Sort has a time complexity of O(n^2), which means that it can be slow for large arrays.

 Others blog:-

1. Bit Manipulation (Lecture 14)| bit manipulation operators

1. Recursion in One Shot | Theory + Question Practice + Code | Level 1 - Easy

1. Top Beginner Patterns in Java: How to Print Star, Number and Character (Lecture 5)

1. String Builder | Reverse a String (using StringBuilder class)| Get A Character from Index| Lecture 13 |

1. Functions in Java | Practice Questions | Complete Placement Course | Lecture 7

My Gadgets 

• My Laptop
• Phone
  
• Mic
  
• Earphone
  
• Tripod