Tri appliqué à un tableau à 2 dimensions basé sur la 2nde dimension

#include <iostream>
#include <algorithm>
#include <vector>

struct MaStruct
{
  MaStruct(int a, int b, int c)
    : _a(a), _b(b), _c(c)
  {
  }

  int _a;
  int _b;
  int _c;
};

void display(const std::vector<MaStruct>& tab)
{
  for (std::vector<MaStruct>::const_iterator it = tab.begin();
       it != tab.end(); ++it)
    std::cout << it->_a << " " << it->_b << " " << it->_c << std::endl;
}

bool sortFunction(const MaStruct& obj1, const MaStruct& obj2)
{
  return obj1._c < obj2._c;
}

int main()
{
  std::vector<MaStruct> tab;
  tab.push_back(MaStruct(3, 3, 3));
  tab.push_back(MaStruct(2, 4, 4));
  tab.push_back(MaStruct(8, 7, 5));
  tab.push_back(MaStruct(6, 4, 3));
  tab.push_back(MaStruct(2, 1, 2));
  tab.push_back(MaStruct(1, 2, 1));

  std::cout << "Before:" << std::endl;
  display(tab);

  std::sort(tab.begin(), tab.end(), sortFunction);

  std::cout << "After:" << std::endl;
  display(tab);

  return 0;
}

void triDuSujet(int m, int[][3]){
        int temp1;
	int temp2;
	int temp3;
	bool tri = true;
	while (tri){    
		tri=false;    	
        	for (int i=0; i < m-1; i++){
       			if (edge[i][2] > edge[i+1][2]){
        			tri=true;
        			temp1 = edge[i][0];
        			temp2 = edge[i][1];
        			temp3 = edge[i][2];
        			
        		        edge[i][0] = edge[i+1][0];
        		        edge[i][1] = edge[i+1][1];
        		        edge[i][2] = edge[i+1][2];
        		        
        		        edge[i+1][0] = temp1;
        		        edge[i+1][1] = temp2;
        		        edge[i+1][2] = temp3;
        		}
       		}
       	}
}