1.冒泡排序
//冒泡排序
for (int i = 0; i <15; i++)
{
for (int j = 0; j < 15 - 1 - i; j++)
{
if (adj[j, 2] > adj[j + 1, 2])
{
int tmp = adj[j, 2];
adj[j, 2] = adj[j + 1, 2];
adj[j + 1, 2] = tmp;
}
}
}