Bubble Sort: Hackerearth Problem and solution

Bubble Sort: Hackerearth Problem and solution in java

Problem:

You have been given an array $A$ of size $N$ . you need to sort this array non-decreasing oder using bubble sort. However, you do not need to print the sorted array . You just need to print the number of swaps required to sort this array using bubble sort

Input Format

The first line consists of a single integer $N$ denoting size of the array. The next line contains $N$ space separated integers denoting the elements of the array.

Output Format Print the required answer in a single line

SAMPLE INPUT

5
1 2 3 4 5

SAMPLE OUTPUT

0

Solution in java:

import java.util.*;


class TestClass {
    public static void main(String args[] ) throws Exception {
        
        Scanner s = new Scanner(System.in);
        int N = s.nextInt();
        int arr[] = new int[N];
        int count=0;
        for (int i = 0; i < N; i++) {
           // System.out.println("hello world");
           arr[i]=s.nextInt();
           
        }
        
        for(int i=N-1;i>0;i--){
        for(int j=0;j<i;j++){
        if(arr[j]>arr[j+1]){
        int temp=arr[j];
        arr[j]=arr[j+1];
        arr[j+1]=temp;
        count++;
        }
        }
        }
        

        System.out.println(count);
    }

}