kevineatsfish的博客

#include<stdio.h> #include<stdlib.h> #define LIST_INIT_SIZE 10 #define LISTINCREMENT 10 typedef int ElemType; typedef int Status; typedef struct { ElemType *elem; int length;//当前长度 int list

#include<stdio.h> #include<math.h> #pragma warning(disable:4996) int Three(const int A[], int N); int Two(const int A[], int N); int One(const int A[], int N); int Max(int MaxLeftSum, int MaxRightSum,

//二分查找函数 int BinarySearch(const int A[], int X, int N) { int Low, Mid, High; Low = 0; High = N - 1; while (Low <= High) { Mid = (Low + High) / 2; if (A[Mid] < X) {