PTA的六度空间问题：地址：请点击“六度空间”理论又称作“六度分隔（SixDegreesofSepa

直接插入折半插入希尔排序快排双向冒泡简单选择排序归并排序堆排序希尔排序出人意料，利用随机枢值的快速排

// Fire.cpp : 定义控制台应用程序的入口点。//#include "stdafx.h"#include "iostream"#define NUM 100using namespace std;char cMap[NUM][NUM];int iBe

// TSP.cpp: 定义控制台应用程序的入口点。//#include "stdafx.h"#include "iostream"#define NUM 100using namespace std;int n;int m;int x[NUM];int be

#include "stdafx.h"#include "iostream"using namespace std;void Perm(int list[], int k, int m) {if (k == m) {for (int i = 0; i <

#include "stdafx.h"#include "iostream"#include <cmath>using namespace std;//输出子集void getSubset(char list[]) {int length = st

#include "iostream"#define NUM 100using namespace std;int a[13]={1,4,5,6,3,16,8,9,11,13,26,15,36,};int select(int left,int right,int k){if(l

#include "stdafx.h"#include "iostream"#define num 100using namespace std;int a[num];int MaxSum(int n){int sum=0;int b=0;for(int i=

#include "stdafx.h"#include "iostream"using namespace std;int a[1001];int b[8]={1,-3,7,8,-4,12,-10,6};int GetMax(int a,int b,int c

#include "stdafx.h"#include "iostream"#define num 100using namespace std;int a[num]; //原始数据//int c[num][num]; //最优解int LIS(int n){