静态查找--改进版,比较时间节约一半

来源:互联网 发布:淘宝申请介入要几天 编辑:程序博客网 时间:2024/06/05 05:27

空间换时间

#include <stdio.h>#include <time.h>#define SIZE 20void print_array(int a[], int len){int i = 0;for (i = 1; i <= len; i++){printf("%d,", a[i]);}printf("\n");}int static_search(int a[], int len, int key){int i = len;a[0] = key;while (a[i] != key){i--;}return i;}int main(void){int a[SIZE + 1] = { 0 };int i = 0;int key = 0;int index = -1;srand((unsigned int)time(NULL));for (i = 1; i <= SIZE; i++){a[i] = rand() % 100;}key = rand() & 100;printf("Static Search Demo\n");printf("Key: %d\n", key);printf("Array: \n");print_array(a, SIZE);index = static_search(a, SIZE, key);if (index >= 1){printf("SUCCED: a[%d] = %d\n", index, a[index]);}else{printf("Failed!!\n");}system("PAUSE");return 0;}


0 0
原创粉丝点击