Week 4

Created by Miroslav Biňas / mirek

Linear Search

int search(int data[], size_t size, int needle){
    for(size_t idx=0; idx < size; idx++){
        if(data[idx] == needle){
            return idx;
        }
    }

    return -1;
}

qsort() Declaration

void qsort(
    void *base,
    size_t nmemb,
    size_t size,
    int (*compar)(const void *, const void *)
);

Comparison Function

int cmp_by_surname(
    const void* p1,
    const void* p2
);

bsearch() Declaration

void *bsearch(
    const void *key,
    const void *base,
    size_t nmemb,
    size_t size,
    int (*compar)(const void *, const void *)
);