将一个数插入有序数组中,保持数组的有序性不变
#include<stdio.h>
#include<stdlib.h>
typedef struct LNode *List;
struct LNode{
int data[100];
int Last;
};
int BinarySearch(List L, int X){
int Left,Right,Mid;
Left = 0;
Right = L->Last
将一个数插入有序数组中,保持数组的有序性不变
#include<stdio.h>
#include<stdlib.h>
typedef struct LNode *List;
struct LNode{
int data[100];
int Last;
};
int BinarySearch(List L, int X){
int Left,Right,Mid;
Left = 0;
Right = L->Last