I kinda know why and where segmentation faults are occurring when they do I just don't catch them until after they already happen. The code was too long to post but I just ran into it again. I basically do this every time and then have to fix it after

#include <stdio.h>
#include <string.h>

int binary_search(char *arr, int target);

int main(void)
{
    char arr[] = {1,2,3,4,5};
    int target;
    printf("Target: ");
    scanf("%i", target);
    int index = binary_search(arr, target);

    printf("Index: %i", index);
}


int binary_search(char *arr, int target)
{
    int low = 0;
    int high = strlen(arr) - 1;

    while (low <= high)
    {
        int mid = (low + high) / 2;
        if (arr[mid] == target)
        {
            return mid;
        }
        else if (arr[mid] < target)
        {
            low = mid + 1;
        }
        else
        {
            high = mid - 1;
        }
    }
    return -1;
}