Note: (Restricted functionality due to obvious reasons!)
Minimal Code ( Raw-View ) :
class ArraySort
{
public static void main(String zee[])
{
int arr[];
arr = new int[7];
arr[0]= 450;
arr[1]= 20;
arr[2]= 930;
arr[3]= 230;
arr[4]= 670;
arr[5]= 529;
arr[6]= 423;
System.out.print("\n Unsorted Array : ");
for(int a=0; a<arr.length; a++)
{
System.out.print(" "+arr[a]);
}
int comp=0;
for(int a=arr.length-1; a>=0; a--) // to make complexity like : x+(x-1)+(x-2)....
{
for(int x=0; x<a; x++) // comparison with
{
if(arr[a]<arr[x])
{
arr[x] = arr[a]+arr[x];
arr[a] = arr[x]-arr[a];
arr[x] = arr[x]-arr[a];
}
comp++;
}
}
System.out.print("\n Sorted Array : ");
for(int a=0; a<arr.length; a++)
{
System.out.print(" "+arr[a]);
}
System.out.println("\n Elements : "+arr.length+" Comparisons : "+comp);
}
}