Lucky的博客

/*60 4 2 5 3 3 4 2 5 31 2 2 6 3 32 3 1 6 3 2 0 53 4 1 3 2 2 0 3 4 44 3 3 4 0 2 5 55 2 0 3 4 50:D1:A2:B3:C4:E5:F输入：邻接表输出：D到各个点的最短路径*/#include<iostream>#include<algorithm>#include<queue>using namespace std;static con

#include<iostream>#include<algorithm>#include<queue>using namespace std;static const int MAX = 10000;static const int INFTY = (1 << 20);static const int WHITE = 0;static const int GRAY = 1;static const int BLACK = 2;int n;

思路首先将最小的数与a[0]对换；再将a[1]~a[n]中最小的数与a[1]对换……每比较一轮，找出一个最小的，共比较n-1轮。代码#include<stdio.h>int main(){ void sort(int array[], int n); int a[10]; for (int i = 0; i < 10; i++) { scanf("%d", &a[i]); } sort(a, 10); for (int i = 0; i < 10