C / C++ / MFC

void Group::getLadder(int ladder[4][8])	
{
	
	
	Sort();
	//ladder = aILadder;

	for(int i = 0; i < 4; i++)
		for (int j = 0; j < 8; j++)
			ladder[i][j] = aILadder[i][j];
		
	
}

void Group::Sort()
{
//----Start arrange the ladder------
	const int TEAM = 0;
	const int PLAYED = 1;
	const int WON = 2;
	const int DRAW = 3;
	const int LOST = 4;
	const int FOR = 5;
	const int AGN = 6;
	const int POINTS = 7;

	int row, col;

	//here do the appropriate action to categorize the  game played, game won, draw, 
	//for, against, and point
	//use some sorting algorithm to sort it descending order
	for( row = 0; row < 4; row++)
	{
		for (col = 0; col < 4 ; col++)
		{
			if( row != col)
			{
				aILadder[row][TEAM] = row;
				
				//if team a win team b do the following things
				if(result[row][col] > result[col][row] && result[row][col] != -1)
				{
					aILadder[row][PLAYED] +=1;
					aILadder[row][WON] += 1;
					aILadder[row][FOR] += result[row][col];
					aILadder[row][AGN] += result[col][row];
					aILadder[row][POINTS] += 3;
					
				}
				else //if team a draws team b do the following things
					if(result[row][col] == result[col][row] && result[row][col] != -1)
					{
						aILadder[row][PLAYED]+=1;
						aILadder[row][DRAW]+=1;
						aILadder[row][FOR] += result[row][col];
						aILadder[row][AGN] += result[col][row];
						aILadder[row][POINTS]+=1;
					}
					else//if team a loses team b do the following things
						if(result[row][col] < result[col][row] && result[row][col] != -1)
						{
							aILadder[row][PLAYED]+=1;
							aILadder[row][LOST]+=1;
							aILadder[row][FOR] += result[row][col];
							aILadder[row][AGN] += result[col][row];
						}
			}
		}
	}
	//-----End arranging the ladder

	//====Now start sorting based on the points use Insertion sort :-)
	int tempArr[1][8];
	int j, target;
	
	for(row = 1; row < 4; row++)	//START AT 1
	{
		j = row;
		target = aILadder[row][POINTS];
		
		while(j > 0 && target > aILadder[j-1][POINTS])
		{
			for(int i = 0; i < 8; i++)
			{
				tempArr[0][i] = aILadder[j-1][i];
				aILadder[j-1][i] = aILadder[j][i];
				aILadder[j][i] = tempArr[0][i];
			}
			j--;
		}
		
		
	}

}

So if you want to have [i][j]
 *(p + i*nSize  + j)
where nSize is the size of the array's first index.

CString GetUserDirectory()
{
	CString strPath ;
	char szDisplayName[_MAX_PATH] ;
	char *szPath = NULL ;
	char *szTitle = _T(" Please Locate Directory : ") ;//Title of Locate Dialog
	
	BROWSEINFO bi = {0} ; //Init to NULL,so we do not have to fill up some members explicitly to NULL
	
	bi.pszDisplayName	= &szDisplayName[0] ;
	bi.lpszTitle		= szTitle ;
	bi.ulFlags		= BIF_RETURNONLYFSDIRS | BIF_RETURNFSANCESTORS ;
	bi.hwndOwner		= NULL ;
	
	LPITEMIDLIST pidl = SHBrowseForFolder(&bi) ;
	if( pidl == NULL ) //User has cancelled operation
		return strPath ;
	
	//Error Check 
	if( !SHGetPathFromIDList(pidl,szPath) )
	{
		AfxMessageBox(" The Path is Invalid ! ") ;
		return strPath ;
	}
	//Release the PIDL thru Shells MAlloc
	IMalloc *pMalloc = NULL ;
	HRESULT hr =  SHGetMalloc(&pMalloc) ;
	if( !SUCCEEDED(hr) )
		return strPath ;
	
	pMalloc->Free( (void*)pidl ) ;//Release the PIDL
	pMalloc->Release() ;//Release the Interface 

	strPath = szPath ;//The Path to the Directory
	return strPath ;
} 
<pre>