顺序查找是一种简单的查找算法,它逐个检查数据集合中的每个元素,直到找到所需的元素或检查完所有元素为止。
时间复杂度:
- 最好情况:O(1)(如果第一个元素就是目标值)
- 平均情况:O(n)(需要检查大约一半的元素)
- 最坏情况:O(n)(需要检查所有元素)
二分查找是一种高效的查找算法,它要求数据集合必须是有序的(通常是升序或降序)。二分查找通过每次比较数据集合中间的元素来缩小搜索范围。
时间复杂度:
- 最好情况:O(1)(如果第一个比较的元素就是目标值)
- 平均情况:O(log n)(每次比较都将搜索范围减半)
- 最坏情况:O(log n)(在最坏的情况下,也需要进行 log n 次比较)
#include<iostream>
using namespace std;
typedef struct Node {
int key;
char value;
}Node, * NodePtr;
typedef struct SequentialList {
int length;
NodePtr elements;
}SequentialList, * 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;
}
end