Is my code a correct implementation of insertion s

Question

This code sorts correctly. Is this an insertion sort?

import java.util.Scanner;
public class InsertionSort {

    public static void main(String[] args) {
        Scanner sc = new Scanner(System.in);
        System.out.println("Enter the number of elements: ");
        int count;
        count = sc.nextInt();
        int[] a = new int[count];
        System.out.println("Enter elements: ");
        for(int i = 0 ; i<count;i++){
            a[i] = sc.nextInt();
        }
        int j,temp;
        System.out.println("aftr insertion sort :");
        for(int i = 1 ; i<count;i++){
            j=i;
            while(j>0 && a[j-1] > a[j] ){
                temp = a[j];
                a[j] = a[j-1];
                a[j-1] = temp;
                j--;
            }
        }
        for(int i = 0 ; i<count;i++){
            System.out.print(a[i]+"  ");
        }
    }
}

Answer 1

I've focused on the second of the three for loops, the one where the actual sorting happens. That loop looks fine to me.