9.1: 顺序查找与二分查找

/**
 * Sequential search and binary search.
 * 
 * @author Fan Min minfanphd@163.com.
 */
#include <stdio.h>
#include <malloc.h>

/**
 * <key, value> pair.
 */
typedef struct Node{
    int key;
    char value;
}Node, *NodePtr;

/**
 * The data structure of the sequential list.
 */
typedef struct SequentialList{
    int length;
    NodePtr elements;
}SequentialList, *ListPtr;

/**
 * Initialize a data array.
 */
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 ++){
        //printf("setting key for index %d: %d and value: %c\r\n", i, paraKeys[i], paraValues[i]);
        resultPtr->elements[i + 1].key = paraKeys[i];
        resultPtr->elements[i + 1].value = paraValues[i];
    }//Of for i

    return resultPtr;
}//Of initList

/**
 * Sequential search.
 * @return The value.
 */
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--;
    }//Of while

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

/**
 * Test the sequential search function.
 */
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));
}// Of sequentialSearchTest

/**
 * Binary search.
 * @return The value.
 */
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;
        }//Of if
    } // Of while

    // Not found.
    return 'x';
}//Of binarySearch

/**
 * Test the binary search function.
 */
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));
}// Of binarySearchTest
    
/**
 * The entrance.
 */
int main(){
    printf("\r\n-------sequentialSearchTest-------\r\n");
    sequentialSearchTest();

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

运行结果：