#include <stdio.h>
#define PATH "/usr/tmp"

char *full_name(const char name[]);

int main()
{
  printf("Full name is %s\n", full_name("data"));
  system ("PAUSE");
  return (0);
}

char *full_name(const char name[])
{
  static char file_name[100];
  strcpy(file_name, PATH);
  strcat(file_name, '/');
  strcat(file_name, name);
  return(file_name);
}

#include <stdio.h>
#define PATH "/usr/tmp"

char *full_name(const char* name);

int main()
{
  printf("Full name is %s\n", full_name("data"));
  system("PAUSE");
  return 0;
}

char *full_name(const char* name)
{
  char* file_name = malloc(sizeof(char) * 100);
  strcpy(file_name, PATH);
  strcat(file_name, "/");
  strcat(file_name, name);
  return file_name;
}

#include <stdio.h>
#include "coaster_info_t.h"

coaster_info_t find_nth_coaster (int *N, int index)
{

  coaster_node_t *current = *N;
  int i = 0;

  if (current != NULL && i != index)
    current = current->next;

  else if (current != NULL && i == index)
    return( current );

  else
    return ( NULL );
}

#include <stdio.h>

int A (int n);

int main(int argc, char *argv[])
{
  int n, x;

  printf ("n = ");
  scanf ("%d", &n);
  printf ("\n");

  x = A (n);
  printf ("A (n) = %.2f\n", x);
  system ("pause");

  return 0;
}

double A (double n)
{
  if (n == 1)
    return n;
  else
    n = A (n / 2) + A (n / 2);
}

A(8)
A(4) + A(4)
(A(2) + A(2)) + (A(2) + A(2))
((A(1) + A(1)) + (A(1) + A(1))) + ((A(1) + A(1)) + (A(1) + A(1)))
A(1) + A(1) + A(1) + A(1) + A(1) + A(1) + A(1) + A(1)
3 + 3 + 3 + 3 + 3 + 3 + 3 + 3
24

(defun a (&optional (n 1))
  (cond ((= n 1) 3)
        ((> n 1)
         (let ((v (a (/ n 2))))
           (+ v v)))
        (t
         (let ((v (a (* n 2))))
           (+ v v)))))

#include <stdio.h>

int A (int n);

int main(int argc, char *argv[])
{
  int n, x;

  printf ("n = ");
  scanf ("%d", &n);
  printf ("\n");

  x = A (n);
  printf ("A (n) = %d\n", x);
  system ("pause");

  return 0;
}

int A (int n)
{
  int ans;
  if (n == 1)
    ans = 1;
  else
    ans = A(n / 2) + A(n / 2);

  return ans;
}

int A (int n)
{
  int ans;
  if (n == 1)
    ans = 1;
  else
    ans = A(n / 2) + A(n / 2);

  return ans;
}

int A (int n)
{
  if (n == 1)
    return 1;
  else
    return A(n / 2) + A(n / 2);
}

if (1 == n)

if (n == 1)

if (n == 1)

if (n = 1)

if (1 == n)

if (1 = n)

#include "coaster_node_t.h"
#include <string.h>
#include <stdlib.h>
#include <stdio.h>

coaster_node_t *remove_duplicate_coasters( coaster_node_t **list, char namedelete[] )
{

  if (*list != NULL)
  {
    while (*list != NULL)
    {
      if (strcmp(*list->data.name, namedelete) != 0)
      {
        coaster_list_delete (&*list, namedelete);
      }
     
      *list->next;
    }
    return (*list);
  }
  else
  {
    printf ("List is empty.\n");
    return (*list);
  }
}

*list->next;

set "current" to first node in list

while current node's not null do
   access current node's stored value,
   and ...

   set "current" to the current node's pointer
   to the next node
end while loop

#include <stdio.h>
#ifndef INT_TYPES
#define INT_TYPES

#include <stdlib.h>
#include <stdio.h>

typedef struct
{
  int value;
}
int_data_t;

typedef struct int_node
{
  int_data_t data;
  struct int_node *next;
}
int_node_t;

// Prototypes.
void create_int_list( int_node_t **, int );
int_node_t *insert_int_list( int_node_t **, int_data_t * );
void print_int_list( int_node_t * );

#endif

int main(int argc, char *argv[])
{

  int_node_t *list;
  int_data_t something;
  something.value = 10;

  *insert_int_list ( &list, &something);
  create_int_list ( &list, something.value );
  print_int_list ( list );
  system("pause");
  return 0;
}

void create_int_list( int_node_t **list, int n )
{
  int i;
  int_data_t temp;

  for( i = n ; i >= 0 ; i-- )
  {
    // Insert the numbers in reverse order into the front of the list.
    temp.value = i;
    insert_int_list( list, &temp );
  }
}

int_node_t *insert_int_list( int_node_t **list, int_data_t *data )
{
  int_node_t *temp = NULL;

  temp = (int_node_t *)malloc( sizeof( int_node_t ) );

  if( temp != NULL )
  {
    temp->data = *data;
    temp->next = *list;
    *list = temp;
  }
  return temp;
}

void print_int_list( int_node_t *list )
{
  int_node_t *current = list;

  while( current != NULL )
  {
    printf( "%4d", current->data.value );
    current = current->next;
  }
  printf( "\n" );
}

typedef struct int_node
 {
   int_data_t data;
   struct int_node *next;
 }
 int_node_t;

int main(int argc, char *argv[])
 {
 
   int_node_t *list;
   int_data_t something;
   something.value = 10;
 
   *insert_int_list ( &list, &something);
   create_int_list ( &list, something.value );
   print_int_list ( list );
   system("pause");
   return 0;
 }

typedef struct
 {
   int value;
 }
 int_data_t;

void median_qsort( int a[], int p, int q, int piv )  /*to sort the subarray */
{                          /* a[p:q] of array A into ascending order */
  int i, j;

  if( p < q )
  {
         /* Initially i and j point to the first and last items */
     i = p;
     j = q;
         partition( a, &i, &j, piv ); /* partitions a[p:q] into a[p:j] and a[i:q] */
         median_qsort( a, p, j, piv );
         median_qsort( a, i, q, piv );
  }
}

void partition( int a[], int *i, int *j, int piv )
{
  int pivot, temp;

  pivot = median (a[*i], a[*j - 1], a[SIZE / 2]);

  if ( piv == 1 )
  {
    if ( pivot == a[*j-1] )
    {
      temp = a[0];
      a[0] = pivot;
      a[*j-1] = temp;
    }
    else if ( pivot == a[SIZE/2] )
    {
      temp = a[0];
      a[0] = pivot;
      a[SIZE/2] = temp;
    }
  }
  else if ( piv == 2 )
  {
    if ( pivot == a[*j-1] )
    {
      temp = a[SIZE/2];
      a[SIZE/2] = pivot;
      a[*j-1] = temp;
    }
    else if ( pivot == a[0] )
    {
      temp = a[SIZE/2];
      a[SIZE/2] = pivot;
      a[0] = temp;
    }
  }
  else if ( piv == 3 )
  {
    if ( pivot == a[0] )
    {
      temp = a[*j-1];
      a[*j-1] = pivot;
      a[0] = temp;
    }
    else if ( pivot == a[SIZE/2] )
    {
      temp = a[*j-1];
      a[*j-1] = pivot;
      a[SIZE/2] = temp;
    }
  }

  print_list ( a, SIZE );

  do {
/* Find leftmost i such that a[i] >= Pivot.*/
        while( &a[*i] <= &pivot )
    {
          (*i)++;
    }
/* Find rightmost j such that a[j] <= Pivot.*/
        while( &a[*j] >= &pivot )
    {
                (*j)--;
        }
/* if i and j didn't cross over one another, swap */
        if (*i <= *j)
    {
                temp = a[*i];
                a[*i] = a[*j];
                a[*j] = temp;         /* a[i] and a[j] */
                (*i)++;               /* move i one space right */
                (*j)--;               /* move j one space left */
         }
  } while (*i >= *j); /* while the i and j pointers haven't crossed yet */
}