challenge-215/deadmarshal/c/ch-1.c


1
2
3
4
5
6
7
8
9
10
11
12
13
14
15
16
17
18
19
20
21
22
23
24
25
26
27
28
29

#include<stdio.h>

int is_alphabetical_order(const char *const str)
{
  for(size_t i = 1; str[i] != '\0'; ++i)
    if(str[i] < str[i-1]) return 0;
  return 1;
}

size_t odd_one_out(const char **arr, size_t sz)
{
  size_t count = 0;
  for(size_t i = 0; i < sz; ++i)
    if(!is_alphabetical_order(arr[i])) count++;
  return count;
}

int main(void)
{
  const char *a1[] = {"abc","xyz","tsu"};
  const char *a2[] = {"rat","cab","dad"};
  const char *a3[] = {"x","y","z"};
  size_t sz = 3;
  printf("%zu\n", odd_one_out(a1,sz));
  printf("%zu\n", odd_one_out(a2,sz));
  printf("%zu\n", odd_one_out(a3,sz));
  return 0;
}