int Second(int A[], int size) {
   int smallest, second_smallest, i ;

   if (size < 2) Error("Need 2 elements\n") ;

   /* First find index of the smallest element */
   smallest = 0 ;
   for (i = 0 ; i < size ; i++) {
      if (A[i] < A[smallest]) smallest = i ;
   }

   /* Initialize second smallest to something not smallest */
   second_smallest = 0 ;
   if (smallest == second_smallest) second_smallest = 1 ;

   /* Find second smallest element */
   for (i = 0 ; i < size ; i++) {
      if (A[i] < A[second_smallest] && i != smallest) {
	 second_smallest = i ;
      }
   }

   return(A[second_smallest]) ;
}