Bubble Sort Program in Java and Python

/**
* The class BubbleSorting inputs an array and sorts the elements in ascending order
* @author : www.guideforschool.com
* @Program Type : BlueJ Program - Java
*/

import java.util.*;
class BubbleSorting
{
    void BubbleSort(int A[]) // function to sort an array in ASCENDING ORDER implementing bubble sort technique
    {
        int n = A.length; // finding size of the array
        int c = 0, f = 1;
        for(int i=0; i<n-1 && f==1; i++)
        {
            f = 0;
            for(int j=0; j<n-1-i; j++)
            {
                if(A[j] > A[j+1]) // for descending use if(A[j] < A[j+1])
                {
                    c = A[j];
                    A[j] = A[j+1];
                    A[j+1] = c;
                    f = 1; // setting f = 1 when swapping takes place i.e. when array is not yet sorted
                }
            }
            if(f == 0) // breaking out of the loop when array is sorted
            break;
        }
        System.out.println("The Array Sorted in Ascending order is : ");
        printArray(A);
    }

    /* Explanation of the above code:
    * 'i' loop is for denoting the step numbers.
    * The maximum number of steps in which any array would get sorted is 'n-1'.
    * So if there are 5 elements in the array, then that array will take a maximum of 4 steps to get sorted.
    * f=1 would mean that the array is not sorted.
    * So f==1 condition is to continue sorting till the array is not sorted.
    * f=0 would mean that the array is sorted.
    * 'j' loop is for comparing one element with the next element i.e. element at index 0 with 1, 1 with 2 etc
    * With every step, the highest element of that step settles down at
    * its correct position i.e. the end of the array, so we need not include it in next step.
    * So, the number of comparisons in every step reduces by one.
    * If there are 5 elements then this is how comparisons take place:
    * In step 1 : 0-1, 1-2, 2-3 and 3-4
    * In step 2 : 0-1, 1-2 and 2-3
    * In step 3 : 0-1 and 1-2
    * In step 4 : 0-1
    * For this reason we have 'j<n-1-i' where as 'i' increases in every step, no of comparisons decreases by 1
    * Before the beginning of every step, we are setting f=0, assuming that the array is sorted.
    * If the array is not sorted, we are swapping the elements, and setting f=1,
    * denoting that the array is not yet sorted and needs sorting.
    * So, if no swapping takes place, that would mean that the array is sorted and the value of f will remain 0.
    * In this case, we are breaking out of the loop and printing the sorted array.
    */

    void printArray(int A[]) // function for printing an array
    {
        int n = A.length;
        for(int i=0; i<n; i++)
        {
            System.out.print(A[i]+ " ");
        }
        System.out.println();
    }

    public static void main(String args[])
    {
        Scanner sc = new Scanner(System.in);
        BubbleSorting ob = new BubbleSorting();
        System.out.print("Enter the number of elements : ");
        int n = sc.nextInt();
        int A[] = new int[n];
        for(int i=0; i<n; i++)
        {
            System.out.print("Enter element "+(i+1)+" : ");
            A[i] = sc.nextInt();
        }
        System.out.println("The Original array is : ");
        ob.printArray(A);
        ob.BubbleSort(A);
    }
}

def bubble_sort(A):
    n = len(A)

    for i in range(n - 1):
        swapped = 0

        # Compare adjacent elements in the unsorted part of the list.
        for j in range(0, n - 1 - i):
            if A[j] > A[j + 1]:
                temp = A[j]
                A[j] = A[j + 1]
                A[j + 1] = temp
                swapped = 1

        # If no swap occurs in a pass, the list is already sorted.
        if swapped == 0:
            break


def print_array(A):
    for i in range(len(A)):
        print(A[i], end=" ")
    print()


n = int(input("Enter the number of elements: "))
A = []

# Store the input values one by one in the list.
for i in range(n):
    value = int(input("Enter element " + str(i + 1) + ": "))
    A.append(value)

print("The Original array is:")
print_array(A)

bubble_sort(A)

print("The Array Sorted in Ascending order is:")
print_array(A)