#include <stdio.h>
#include <stdlib.h>
#define size1 2
#define size2 3

int values[size1][size2] = {    {10,   30,  9 },
				{11,   12, -12}};
			
struct IntVec3 {int i; int j; int val;};

int order_q(const void * p1, const void * p2){
	struct  IntVec3 i1, i2, *pi1, *pi2;
	//Casting generic pointers to IntVec3 *
	pi1 = (struct IntVec3 * ) p1;
	pi2 = (struct IntVec3 * ) p2;
	
	// Getting the IntVecs
	i1 = *pi1;
	i2 = *pi2;
	
	//Returning the difference in the values
	return (i1.val - i2.val);
	}
	
int main(){
  int i,j;
  struct IntVec3 TaggedArray[size1][size2];
  struct IntVec3 TaggedElement, *vp;
  
  // Putting cooridnates {i,j} and count in TaggedArray
  /*
  for(i=0;i<size1;i++){
    for(j=0;j<size2;j++){
      (TaggedArray[i][j]).i = i;
      (TaggedArray[i][j]).j = j;
      (TaggedArray[i][j]).val = values[i][j];
      }
    }
    */
    
   // Putting cooridnates {i,j} and count in TaggedArray
  /* for(i=0;i<size1;i++){
    for(j=0;j<size2;j++){
      struct IntVec3 TaggedElement = {i, j, values[i][j]};
      TaggedArray[i][j] = TaggedElement;
      }
    }
    */
    
   // Putting cooridnates {i,j} and count in TaggedArray
  for(i=0;i<size1;i++){
    for(j=0;j<size2;j++){
      vp = TaggedArray[i]+j;
      vp->i = i; vp->j = j; vp->val = values[i][j];
      }
    }
    
  //Sorts TaggedArray
  qsort(TaggedArray, size1*size2, sizeof(struct IntVec3), order_q);
  
  for(i=0; i<size1; i++){
   for(j=0;j<size2;j++){
     vp = TaggedArray[i]+j;
     printf("{%d, %d} -> %d\n", vp->i, vp->j, vp->val);
     }
   }
   
   // Or as a flat array
  //for(i=0; i<size1*size2; i++){
   //  vp = TaggedArray[0]+i;
   //  printf("{%d, %d} -> %d\n", vp->i, vp->j, vp->val);
   //  }
     
  return 0;
  }