In this program, we will create an array of integers then we will sort array elements in ascending order using bubble sort.

In the bubble sort sorting technique, we compare adjacent elements and swap if they are in the wrong order. This process repeats until no more swaps are needed.

Program/Source Code:

The source code to sort an array in ascending order using bubble sort is given below. The given program is compiled and executed successfully.

// Java program to sort an array in ascending order 
// using bubble sort

import java.util.Scanner;

public class Main {
  public static void main(String[] args) {
    Scanner SC = new Scanner(System.in);

    int i = 0;
    int j = 0;
    int t = 0;

    int arr[] = {
      14, 49, 79, 87, 78};

    //Sort array using bubble sort.
    while (i < 5) {
      j = 4;
      while (j > i) {
        if (arr[j] < arr[j - 1]) {
          t = arr[j];
          arr[j] = arr[j - 1];
          arr[j - 1] = t;
        }
        j = j - 1;
      }
      i = i + 1;
    }

    System.out.println("Sorted Array in ascending order: ");
    i = 0;
    while (i < 5) {
      System.out.print(arr[i] + " ");
      i = i + 1;
    }
  }
}

Output:

Sorted Array in ascending order: 
14 49 78 79 87