weixin_45866832的博客

#include<stdio.h>void sort(int *arr, int len)//直接插入排序{ for (int i = 0; i < len-1; i++) { int end = i;//记录最后有序的下标初始第一个元素有序 int temp = arr[end + 1];//待插入的元素； while (end >= 0) { if (temp < arr[end]) { arr[end + 1] = arr[e.

#include<stdio.h>int Search(int *arr,int len,int key)//顺序查找{ int i = 0; for (; i < len; i++) { if (arr[i] == key) return i; if (i ==len) return -1; }}int main(){ int arr[] = { 5, 32, 11, 43, 90, 23 }; int len = sizeof(arr) /.