/*@HEADER
// ***********************************************************************
//
//       Ifpack: Object-Oriented Algebraic Preconditioner Package
//                 Copyright (2002) Sandia Corporation
//
// Under terms of Contract DE-AC04-94AL85000, there is a non-exclusive
// license for use of this work by or on behalf of the U.S. Government.
//
// Redistribution and use in source and binary forms, with or without
// modification, are permitted provided that the following conditions are
// met:
//
// 1. Redistributions of source code must retain the above copyright
// notice, this list of conditions and the following disclaimer.
//
// 2. Redistributions in binary form must reproduce the above copyright
// notice, this list of conditions and the following disclaimer in the
// documentation and/or other materials provided with the distribution.
//
// 3. Neither the name of the Corporation nor the names of the
// contributors may be used to endorse or promote products derived from
// this software without specific prior written permission.
//
// THIS SOFTWARE IS PROVIDED BY SANDIA CORPORATION "AS IS" AND ANY
// EXPRESS OR IMPLIED WARRANTIES, INCLUDING, BUT NOT LIMITED TO, THE
// IMPLIED WARRANTIES OF MERCHANTABILITY AND FITNESS FOR A PARTICULAR
// PURPOSE ARE DISCLAIMED. IN NO EVENT SHALL SANDIA CORPORATION OR THE
// CONTRIBUTORS BE LIABLE FOR ANY DIRECT, INDIRECT, INCIDENTAL, SPECIAL,
// EXEMPLARY, OR CONSEQUENTIAL DAMAGES (INCLUDING, BUT NOT LIMITED TO,
// PROCUREMENT OF SUBSTITUTE GOODS OR SERVICES; LOSS OF USE, DATA, OR
// PROFITS; OR BUSINESS INTERRUPTION) HOWEVER CAUSED AND ON ANY THEORY OF
// LIABILITY, WHETHER IN CONTRACT, STRICT LIABILITY, OR TORT (INCLUDING
// NEGLIGENCE OR OTHERWISE) ARISING IN ANY WAY OUT OF THE USE OF THIS
// SOFTWARE, EVEN IF ADVISED OF THE POSSIBILITY OF SUCH DAMAGE.
//
// Questions? Contact Michael A. Heroux (maherou@sandia.gov)
//
// ***********************************************************************
//@HEADER
*/

/* shell sort adopted from Edmond Chow */

#include "shellSort_dh.h"

#undef __FUNC__
#define __FUNC__ "shellSort_int"
void
shellSort_int (const int n, int *x)
{
  START_FUNC_DH int m, max, j, k, itemp;

  m = n / 2;
  while (m > 0)
    {
      max = n - m;
      for (j = 0; j < max; j++)
	{
	  for (k = j; k >= 0; k -= m)
	    {
	      if (x[k + m] >= x[k])
		break;
	      itemp = x[k + m];
	      x[k + m] = x[k];
	      x[k] = itemp;
	    }
	}
      m = m / 2;
    }
END_FUNC_DH}

#undef __FUNC__
#define __FUNC__ "shellSort_float"
void
shellSort_float (const int n, double *x)
{
  START_FUNC_DH int m, max, j, k;
  double itemp;

  m = n / 2;
  while (m > 0)
    {
      max = n - m;
      for (j = 0; j < max; j++)
	{
	  for (k = j; k >= 0; k -= m)
	    {
	      if (x[k + m] >= x[k])
		break;
	      itemp = x[k + m];
	      x[k + m] = x[k];
	      x[k] = itemp;
	    }
	}
      m = m / 2;
    }
END_FUNC_DH}


#if 0
#undef __FUNC__
#define __FUNC__ "shellSort_int_float"
void
shellSort_int_float (int n, int *x, VAL_DH * xVals)
{
  START_FUNC_DH int m, max, j, k, itemp;
  VAL_DH atemp;

  m = n / 2;
  while (m > 0)
    {
      max = n - m;
      for (j = 0; j < max; j++)
	{
	  for (k = j; k >= 0; k -= m)
	    {
	      if (x[k + m] >= x[k])
		break;
	      itemp = x[k + m];
	      atemp = xVals[k + m];
	      x[k + m] = x[k];
	      /* xVals[k+m] = xVals[k]; */
	      x[k] = itemp;
	      xVals[k] = atemp;
	    }
	}
      m = m / 2;
    }
END_FUNC_DH}
#endif
