// Header.h#ifndef HEADER_H#define HEADER_H    1// 预定义常量和类型// 函数结果状态代码#define TRUE 1#define FALSE 0#define OK 1#define ERROR 0#define INFEASIBLE -1#define OVERFLOW -2type

<br />//======================================================================= // Copyright 2001 Jeremy G. Siek, Andrew Lumsdaine, Lie-Quan Lee, // // Distributed under the Boost Software License, Version 1.0. (See // accompanying file LICENSE_1_0.tx

#include using namespace std;/* Greatest common divisor */unsigned long gcd(unsigned long a, unsigned long b){    unsigned long r;    if (a         swap(a, b);    while ((r = a % b)

/* 插入排序 InsertionSort */#include #include #include #include #include #include using namespace std;typedef vector VI;#define N 10void InsertionSort(int a[], int n);void

// Header.h#ifndef HEADER_H#define HEADER_H    1// 预定义常量和类型// 函数结果状态代码#define TRUE 1#define FALSE 0#define OK 1#define ERROR 0#define INFEASIBLE -1#define OVERFLOW -2type

#include #include #include using namespace std;#define OK 1#define ERROR 0typedef int Status;typedef int ElemType;/* 线性表的单链表存储结构 */typedef struct LNode {    ElemType data;

//Header.h#ifndef HEADER_H#define HEADER_H// 预定义常量和类型// 函数结果状态代码#define TRUE 1#define FALSE 0#define OK 1#define ERROR 0#defi

// Header.h#ifndef HEADER_H#define HEADER_H    1// 预定义常量和类型// 函数结果状态代码#define TRUE 1#define FALSE 0#define OK 1#define ERROR 0#define INFEASIBLE -1#define OVERFLOW -2type

// Header.h#ifndef HEADER_H#define HEADER_H    1// 预定义常量和类型// 函数结果状态代码#define TRUE 1#define FALSE 0#define OK 1#define ERROR 0#define INFEASIBLE -1#define OVERFLOW -2typede