第1个回答 2014-12-10
// 刚写的,验证过无误
#include<stdio.h>
int binary_search(int *src,int num, int tar){ //二分查找
int head = 0;
int tail = num - 1;
int mid;
while(head <= tail){
mid = (head + tail) / 2;
if(src[mid] == tar){
return mid;
}else if(src[mid] > tar){
tail = mid - 1;
}else {
head = mid + 1;
}
if(head == tail&&src[head] != tar){
return head;
}
}
}
int insert_array(int * src,int &num, int tar){//检查并插入
int res = binary_search(src, num, tar);
if(src[res] == tar){
return res;
}else if (src[res] > tar){
for(int i = num; i > res; i--){
src[i] = src[i-1];
}
src[res] = tar;
num = num + 1;
return -1;//如果是插入操作返回-1
}else{
for(int i = num; i > res + 1; i--){
src[i] = src[i - 1];
}
src[res + 1] = tar;
num = num + 1;
return -1;//
}
}
int main(){
int src[10] = {1, 2 ,4, 8};
int num = 4;
int res = insert_array(src, num, 9);
printf("%d\n", res);
return 0;
}
第3个回答 2014-12-10
#include <stdio.h>
#define N 10
int main(void)
{
int a[N] = { 1, 2, 5, 7, 9 };
int i = N - 1, n;
scanf("%d", &n);
while (a[i] == 0)
i--;
while (a[i] > n) {
a[i + 1] = a[i];
i--;
}
if (a[i] == n)
printf("already exist(%d)\n", i + 1);
else
a[i + 1] = n;
return 0;
}