Algorithms

//Inserting sort

int A[] = {3,43,34,21,7,56,2};
for (int i=1;i<A.length;i++){
  int key = A[i];
  loop: for(int j= i-1;j>=0;j--){
     if(A[j] > key){
       A[j + 1 ] = A[j];
      if ( j == 0)
         A[j] = key;
     }else{
        A[j+1] = key;
        break loop;
     }
}