Bubble Sort Implementation in Java - A Detailed Guide of Character Sorting

Data Structure Sorting (Article) Sorting (Program)

91

---

Sorting algorithms play a crucial role in computer science, helping to organize data efficiently. One of the simplest sorting algorithms is Bubble Sort. It repeatedly compares adjacent elements and swaps them if they are in the wrong order. Although not the most efficient algorithm, Bubble Sort is an excellent way to understand the fundamentals of sorting.

In this blog post, we'll dive deep into Bubble Sort, understand its working with an example, analyze its time complexity, and implement it in Java.

Given Input:

Input Array: ['d', 'a', 'c', 'b']

Expected Output:

Sorted Array: ['a', 'b', 'c', 'd']

Program:

import java.util.*;

public class Charsort {
    public static void bubbleSort(char[] array) {
        int num = array.length;
        char temp;

        for (int i = 0; i < num - 1; i++) {  // Loop runs num-1 times
            for (int j = 0; j < num - i - 1; j++) {  // Inner loop reduces after each pass
                if (array[j] > array[j + 1]) {  // Swap if elements are in wrong order
                    temp = array[j];
                    array[j] = array[j + 1];
                    array[j + 1] = temp;
                }
            }
        }
    }

    public static void main(String[] args) {
        char array[] = new char[10];
        Scanner sc = new Scanner(System.in);

        System.out.println("Enter 10 characters:");
        for (int i = 0; i < 10; i++) {
            array[i] = sc.next().charAt(0);  // Use sc.next() to avoid newline issues
        }

        System.out.println("Array Before Bubble Sort: " + Arrays.toString(array));
        bubbleSort(array);
        System.out.println("Array After Bubble Sort: " + Arrays.toString(array));
        
        sc.close();  // Close Scanner to avoid resource leak
    }
}

Output:

Sorted Array: ['a', 'b', 'c', 'd']

Explanation:

---

---