blob: 645a520a4e2ffd941facb763c7a6decb5c782a5b (
plain)
1
2
3
4
5
6
7
8
9
10
11
12
13
14
15
16
17
18
19
20
21
22
23
24
25
26
27
28
29
30
31
32
33
34
35
36
37
38
39
40
41
42
43
44
45
46
47
48
49
50
51
|
*DECK SORTRE
SUBROUTINE SORTRE(N,ARRAY)
*
*-----------------------------------------------------------------------
*
*Purpose:
* Sort an array of reals by increasing order using the "Insertion sort"
* method. Based on the C routine available at
* http://linux.wku.edu/~lamonml/algor/sort/insertion.html
*
*Copyright:
* Copyright (C) 2002 Ecole Polytechnique de Montreal
* This library is free software; you can redistribute it and/or
* modify it under the terms of the GNU Lesser General Public
* License as published by the Free Software Foundation; either
* version 2.1 of the License, or (at your option) any later version
*
*Author(s): R. Le Tellier
*
*Parameters: input
* N size of the array.
*
*Parameters: input/output
* ARRAY array of reals.
*
*-----------------------------------------------------------------------
*
IMPLICIT NONE
*---
* SUBROUTINE ARGUMENTS
*---
INTEGER N
REAL ARRAY(N)
*---
* LOCAL VARIABLES
*---
INTEGER I,J
REAL WORK
*
DO I = 2, N
WORK = ARRAY(I)
J = I
DO WHILE ((J.GT.1).AND.(ARRAY(J-1).GT.WORK))
ARRAY(J) = ARRAY(J-1)
J = J - 1
ENDDO
ARRAY(J) = WORK
ENDDO
*
RETURN
END
|
