another way of implementing linear search

linear_search_alternative.c

#include <stdio.h>

int main(void)
{
  // linear search
  // given a value to find
  // search each element in the array
  // if found return the value/position
  
  int haystack[] = {1,2,3,4,5,6};
  int length = sizeof haystack/sizeof haystack[0];

  int needle = 6;

  int i = 0;
  while(i < length && haystack[i] != needle)
    i++;

  if(haystack[i] != needle)
    printf("needle not found!\n");
  else
    printf("found needle (%i) at position (%i)\n", needle, i);

  return 0;
}