Implementing Bubble Sort Algorithm using Java Program

package org.code2care.java.sorting.algo;


import java.util.Arrays;

/**
 * BubbleSort Example in Java
 *
 * Author: Code2care.org
 * Date: 28 April 2023
 * Version: v 1.0
 *
 */
public class BubbleSortJavaExample {

    public static void main(String[] args) {

        //Unsorted Array
        int[] unsortedArray = {4, 99, 2, 11, 34, 67, 54, 12, 45, 245, 234, 12, 200};
        BubbleSortJavaExample bubbleSort = new BubbleSortJavaExample();

        //Note: new array or Arrays.toString is not needed - added just for clarity
        int[] sortedArray = bubbleSort.bubbleSortAlgorithm(unsortedArray);
        System.out.println(Arrays.toString(sortedArray));
    }

    /**
     *
     * @param arrayOfNumbers: unsorted array as provided to sort
     * @return: sorted array using bubble sort
     */
    public int[] bubbleSortAlgorithm(int[] arrayOfNumbers) {

        int arrayLength = arrayOfNumbers.length;
        int tempVariable = 0;

        for (int outerIndex = 0; outerIndex < arrayLength - 1; outerIndex++) {

            for (int innerIndex = 0; innerIndex < arrayLength - outerIndex - 1; innerIndex++) {

                int elementN = arrayOfNumbers[innerIndex];
                int elementNPlus1 = arrayOfNumbers[innerIndex + 1];

                if (elementN > elementNPlus1) {
                    tempVariable = arrayOfNumbers[innerIndex];
                    arrayOfNumbers[innerIndex] = arrayOfNumbers[innerIndex + 1];
                    arrayOfNumbers[innerIndex + 1] = tempVariable;
                }
            }
        }

        return arrayOfNumbers;
    }
}

Output:

Complexity	Notation
Time complexity (worst-case)	O(n^2)
Time complexity (average-case)	O(n^2)
Time complexity (best-case)	O(n)
Space complexity	O(1)