Detect Circular Pattern Match

O(2*n)

#include <stdio.h>
#include <stdint.h>

uint8_t is_circular_match(uint16_t reg, uint16_t target) {
    //first rotate left
    uint16_t left_rotate;
    for(int i=0;i<=15;i++)
    {
        left_rotate = (reg << i) | (reg >> (16-i));
        if(left_rotate == target) return 1;
    }

    uint16_t right_rotate;
    for(int i=0;i<=15;i++)
    {
        right_rotate = (reg >> i) | (reg << (16-i));
        if(right_rotate == target) return 1;
    }


    return 0;
}

int main() {
    uint16_t reg, target;
    scanf("%hu %hu", &reg, &target);
    printf("%hhu", is_circular_match(reg, target));
    return 0;
}

Solving Approach