Algorithm Start a:=null i:=0 n:=0 j:=0 temp:=0 Print "Enter the size of the array" Read n a=new int[n] i=0 If i<n, go to step 12 or else go to step 15 Print "Enter a number" Read a[i] i++. Go to step 11 i=0 If i<n, go to step 17 or else go to step 25 temp=a[i] j=i-1 If j>=0 && a[j]>temp, go to step 20 or else go to step 23 a[j+1]=[j] j=j-1 Go to step 19 a[j+1]=temp i++. Go to step 16 i=0 If i<n, go to step 27 or else go to step 29 Print a[i]; i++. Go to step 26 Stop Program Buffered Reader import java.io.*; class SortArray { int a[], i, n, j, temp; void accept() throws IOException { BufferedReader br=new BufferedReader(new InputStreamReader (System.in)); System.out.println("Enter the size of the array"); n=Integer.parseInt(br.readLine()); a=new int[n]; for(i=...