0-main.c

#include <stdio.h>
#include <stdlib.h>
#include "search_algos.h"

/**
 * main - Entry point
 *
 * Return: Always EXIT_SUCCESS
 */
int main(void)
{
    int array[] = {
        10, 1, 42, 3, 4, 42, 6, 7, -1, 9
    };
    size_t size = sizeof(array) / sizeof(array[0]);

    printf("Found %d at index: %d\n\n", 3, linear_search(array, size, 3));
    printf("Found %d at index: %d\n\n", 42, linear_search(array, size, 42));
    printf("Found %d at index: %d\n", 999, linear_search(array, size, 999));
    return (EXIT_SUCCESS);
}

/**
 * main_0.c - case: Find a value with only one occurrence in the array
 * main - Entry point
 *
 * Return: Always 0 (Success)
 */
int main(void)
{
	int array[10] = {
		8, 1, 42, 3, 4, 42, 6, 7, -1, 9
	};

	printf("Found at index: %d\n", linear_search(array, 10, 3));
	return (0);
}

/**
 * main_1.c - case: Find a value with multiple occurrences in the array
 * main - Entry point
 *
 * Return: Always 0 (Success)
 */
int main(void)
{
	int array[10] = {
		10, 1, 21, 3, 4, 21, 6, 7, -1, 9
	};

	printf("Found at index: %d\n", linear_search(array, 10, 21));
	return (0);
}

/**
 * main_2.c - case: Find a value which is not in the array
 * main - Entry point
 *
 * Return: Always 0 (Success)
 */
int main(void)
{
	int array[10] = {
		10, 1, 42, 3, 4, 21, 6, 7, -1, 9
	};

	printf("Found at index: %d\n", linear_search(array, 10, 123456789));
	return (0);
}

/**
 * main_3.c - case: linear_search(NULL, 0, 0)
 * main - Entry point
 *
 * Return: Always 0 (Success)
 */
int main(void)
{
	printf("Found at index: %d\n", linear_search(NULL, 0, 0));
	return (0);
}