IFPACK Development
Loading...
Searching...
No Matches
shellSort_dh.c
1/*@HEADER
2// ***********************************************************************
3//
4// Ifpack: Object-Oriented Algebraic Preconditioner Package
5// Copyright (2002) Sandia Corporation
6//
7// Under terms of Contract DE-AC04-94AL85000, there is a non-exclusive
8// license for use of this work by or on behalf of the U.S. Government.
9//
10// Redistribution and use in source and binary forms, with or without
11// modification, are permitted provided that the following conditions are
12// met:
13//
14// 1. Redistributions of source code must retain the above copyright
15// notice, this list of conditions and the following disclaimer.
16//
17// 2. Redistributions in binary form must reproduce the above copyright
18// notice, this list of conditions and the following disclaimer in the
19// documentation and/or other materials provided with the distribution.
20//
21// 3. Neither the name of the Corporation nor the names of the
22// contributors may be used to endorse or promote products derived from
23// this software without specific prior written permission.
24//
25// THIS SOFTWARE IS PROVIDED BY SANDIA CORPORATION "AS IS" AND ANY
26// EXPRESS OR IMPLIED WARRANTIES, INCLUDING, BUT NOT LIMITED TO, THE
27// IMPLIED WARRANTIES OF MERCHANTABILITY AND FITNESS FOR A PARTICULAR
28// PURPOSE ARE DISCLAIMED. IN NO EVENT SHALL SANDIA CORPORATION OR THE
29// CONTRIBUTORS BE LIABLE FOR ANY DIRECT, INDIRECT, INCIDENTAL, SPECIAL,
30// EXEMPLARY, OR CONSEQUENTIAL DAMAGES (INCLUDING, BUT NOT LIMITED TO,
31// PROCUREMENT OF SUBSTITUTE GOODS OR SERVICES; LOSS OF USE, DATA, OR
32// PROFITS; OR BUSINESS INTERRUPTION) HOWEVER CAUSED AND ON ANY THEORY OF
33// LIABILITY, WHETHER IN CONTRACT, STRICT LIABILITY, OR TORT (INCLUDING
34// NEGLIGENCE OR OTHERWISE) ARISING IN ANY WAY OUT OF THE USE OF THIS
35// SOFTWARE, EVEN IF ADVISED OF THE POSSIBILITY OF SUCH DAMAGE.
36//
37// Questions? Contact Michael A. Heroux (maherou@sandia.gov)
38//
39// ***********************************************************************
40//@HEADER
41*/
42
43/* shell sort adopted from Edmond Chow */
44
45#include "shellSort_dh.h"
46
47#undef __FUNC__
48#define __FUNC__ "shellSort_int"
49void
50shellSort_int (const int n, int *x)
51{
52 START_FUNC_DH int m, max, j, k, itemp;
53
54 m = n / 2;
55 while (m > 0)
56 {
57 max = n - m;
58 for (j = 0; j < max; j++)
59 {
60 for (k = j; k >= 0; k -= m)
61 {
62 if (x[k + m] >= x[k])
63 break;
64 itemp = x[k + m];
65 x[k + m] = x[k];
66 x[k] = itemp;
67 }
68 }
69 m = m / 2;
70 }
71END_FUNC_DH}
72
73#undef __FUNC__
74#define __FUNC__ "shellSort_float"
75void
76shellSort_float (const int n, double *x)
77{
78 START_FUNC_DH int m, max, j, k;
79 double itemp;
80
81 m = n / 2;
82 while (m > 0)
83 {
84 max = n - m;
85 for (j = 0; j < max; j++)
86 {
87 for (k = j; k >= 0; k -= m)
88 {
89 if (x[k + m] >= x[k])
90 break;
91 itemp = x[k + m];
92 x[k + m] = x[k];
93 x[k] = itemp;
94 }
95 }
96 m = m / 2;
97 }
98END_FUNC_DH}
99
100
101#if 0
102#undef __FUNC__
103#define __FUNC__ "shellSort_int_float"
104void
105shellSort_int_float (int n, int *x, VAL_DH * xVals)
106{
107 START_FUNC_DH int m, max, j, k, itemp;
108 VAL_DH atemp;
109
110 m = n / 2;
111 while (m > 0)
112 {
113 max = n - m;
114 for (j = 0; j < max; j++)
115 {
116 for (k = j; k >= 0; k -= m)
117 {
118 if (x[k + m] >= x[k])
119 break;
120 itemp = x[k + m];
121 atemp = xVals[k + m];
122 x[k + m] = x[k];
123 /* xVals[k+m] = xVals[k]; */
124 x[k] = itemp;
125 xVals[k] = atemp;
126 }
127 }
128 m = m / 2;
129 }
130END_FUNC_DH}
131#endif