顺序查找与二分查找

代码

#include <stdio.h>
#include<malloc.h>

typedef struct Node {
	int key;
	char value;
}Node,*NodePtr;

typedef struct SequentialList {
	int length;
	NodePtr elements;
}SequentialLiat,*ListPtr;

ListPtr initList(int* paraKeys, char* paraValues, int paraLength) {
	int i;
	ListPtr resultPtr = (ListPtr)malloc(sizeof(struct SequentialList));
	resultPtr->length = paraLength;
	resultPtr->elements = (NodePtr)malloc((paraLength + 1) * sizeof(struct Node));
	for (i = 0; i < paraLength; i++) {
		resultPtr->elements[i + 1].key = paraKeys[i];
		resultPtr->elements[i + 1].value = paraValues[i];
	}

	return resultPtr;
}

char sequentialSearch(ListPtr paraListPtr, int paraKey) {
	int i = paraListPtr->length;
	paraListPtr->elements[0].key = paraKey;
	paraListPtr->elements[0].value = 'x';

	while (paraListPtr->elements[i].key != paraKey) {
		i--;
	}

	return paraListPtr->elements[i].value;
}

void sequentialSearchTest() {
	int tempUnsortedKeys[] = { 4, 5, 3, 6, 10, 7, 1, 9 };
	char tempContents[] = { 'h', 'e', 'l', 'o', 'w', 'r', 'd', '!' };
	ListPtr tempListPtr = initList(tempUnsortedKeys, tempContents, 8);

	printf("Search result of 10 is: %c\r\n", sequentialSearch(tempListPtr, 10));
	printf("Search result of 5 is: %c\r\n", sequentialSearch(tempListPtr, 5));
	printf("Search result of 4 is: %c\r\n", sequentialSearch(tempListPtr, 4));
	printf("Search result of 2 is: %c\r\n", sequentialSearch(tempListPtr, 2));
}

char binarySearch(ListPtr paraListPtr, int paraKey) {
	int tempLeft = 1;
	int tempRight = paraListPtr->length;
	int tempMiddle = (tempLeft + tempRight) / 2;

	while (tempLeft <= tempRight) {
		tempMiddle = (tempLeft + tempRight) / 2;
		if (paraListPtr->elements[tempMiddle].key == paraKey) {
			return paraListPtr->elements[tempMiddle].value;
		}
		else if (paraListPtr->elements[tempMiddle].key <= paraKey) {
			tempLeft = tempMiddle + 1;
		}
		else {
			tempRight = tempMiddle - 1;
		}
	}

	return 'x';
}

void binarySearchTest() {
	int tempUnsortedKeys[] = { 1, 3, 4, 5, 6, 7, 9, 10 };
	char tempContents[] = { 'h', 'e', 'l', 'o', 'w', 'r', 'd', '!' };
	ListPtr tempListPtr = initList(tempUnsortedKeys, tempContents, 8);

	printf("Search result of 10 is: %c\r\n", binarySearch(tempListPtr, 10));
	printf("Search result of 5 is: %c\r\n", binarySearch(tempListPtr, 5));
	printf("Search result of 4 is: %c\r\n", binarySearch(tempListPtr, 4));
	printf("Search result of 2 is: %c\r\n", binarySearch(tempListPtr, 2));
}

int main(){
	printf("\r\n-------sequentialSearchTest-------\r\n");
	sequentialSearchTest();

	printf("\r\n-------binarySearchTest-------\r\n");
	binarySearchTest();
	return 1;
}

运行结果

-------sequentialSearchTest-------
Search result of 10 is: w
Search result of 5 is: e
Search result of 4 is: h
Search result of 2 is: x

-------binarySearchTest-------
Search result of 10 is: !
Search result of 5 is: o
Search result of 4 is: l
Search result of 2 is: x

代码解说

1.在顺序查找中，代码设置了一个哨兵。顺序查找是一种最简单的查找方法。它从列表的一端开始，逐个检查每个元素，直到找到所需的元素或搜索完整个列表。

2.二分查找是一种在有序列表中高效查找特定元素的算法。每次查找时，它都会取列表的中间元素进行比较。如果要查找的元素小于中间元素，则在列表的左半部分继续查找；如果要查找的元素大于中间元素，则在列表的右半部分继续查找。这个过程会一直重复，直到找到元素或确定元素不存在于列表中。