Insertion Sorting

import java.security.SecureRandom;
import java.util.Scanner;

public class InsertionSortingShuvo {
public static void InsertionSort(int[] list)
    {
        int index,previous_index,key,temp ;
        int low = 0 ;
        int high = list.length ;

        for(index = low ; index < high ; index++)
        {
            previous_index = index - 1 ;
            key = list[index] ;

            while(previous_index >= 0 && key < list[previous_index])
            {
                temp = list[previous_index] ;
                list[previous_index] = list[previous_index+1] ;
                list[previous_index+1] = temp ;

                previous_index-- ;
            }
        }
    }

    public static void printlist(int[] list)
    {
        for(int i = 0 ; i < list.length ; i++)
            System.out.print(list[i]+" ");
        System.out.println();
    }

    public static void main(String[] args) {

        SecureRandom secureRandom = new SecureRandom() ;
        Scanner input = new Scanner(System.in) ;
        System.out.print("Enter list size : ");
        int size = input.nextInt() ;

        int[] list = new int[size] ;

        //populating list with random numbers
        for(int i = 0 ; i < list.length ; i++)
            list[i] = secureRandom.nextInt(90) ;

        printlist(list);

        System.out.println("after sorting : ");

        //BubbleSort(list) ;
        InsertionSort(list);

        printlist(list);

        input.close();

    }

}