// 02282008a.html, P H Anderson, Feb 28, '08

#include <stdio.h>

void reverse_array(int a[], int b[], int num);
int is_palindromic(int a[], int num);
void sort_array(int a[], int num_ele);
void print_array(int a[], int num);
void swap_ints(int *p1, int *p2);

#define TRUE !0
#define FALSE 0

int main()
{
    int a1[5] = {7, 1, 9, -1, 3}, a2[5], a3[6] = {2, -1, 6, 6, -1, 2};
    int x;
    
    print_array(a1, 5);
    reverse_array(a1, a2, 5);
    print_array(a2, 5);   
    
    sort_array(a2, 5);
    print_array(a2, 5);     
    
    x = is_palindromic(a3, 6);
    if (x == TRUE)
    {
        printf("Is palindromic\n");
    }
    else
    {
        printf("Isn't palindromic\n");
    }
    
    while (getchar() != 'x')
    {
    }
}
    
void reverse_array(int a[], int b[], int num)
{   // stub
   int n;
   for (n=0; n<num; n++)
   {
        b[n] = a[n];
    }
   swap_ints(&b[0], &b[num-1]);
}
    
int is_palindromic(int a[], int num)
{
    return(TRUE);
}

void sort_array(int a[], int num_ele)
{ // stub
  swap_ints(&a[1], &a[2]);
}

void print_array(int a[], int num)
{  // real implentation
    int n;
    for (n=0; n<num; n++)
    {
        printf("%i ", a[n]);
    }
    printf("\n");
}

void swap_ints(int *p1, int *p2)
{   //real implementation
    int temp;
    temp = *p1;
    *p1 = *p2;
    *p2 = temp;
}

/*
7 1 9 -1 3
3 1 9 -1 7
3 9 1 -1 7
Is palindromic
*/