Java-stuff/ArrayOps.java at master · SSabev/Java-stuff · GitHub

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
52
53
54
55
56
57
58
59
60
61
62
63
64
65
66
67
68
69
70
71
72
73
74
75
76
77
78
79
80
81
82
83
84
85
86
87
88
89
90
91
92
93
94
public class ArrayOps
{
    static public double findMax( double[] data)
    {
		double n = -32768.0;

		for (int i = 0; i < data.length; i++)
		{
			if (n < data[i])
			{
				n = data[i];
			}
		}

		return n;

    }

    static public void swap( double[] data1, double[] data2)
    {
		for ( int i = 0; i < data1.length; i++)
		{
			double c = data1[i];
			data1[i]=data2[i];
			data2[i]=c;
		}
    }

    static public void normaliseInPlace( double data[] )
    {
		double sum = 0.0;

		for ( int i = 0; i < data.length; i++ )
		{
			sum += data[i];
		}

		for ( int i = 0; i < data.length; i++ )
		{
			data[i] /= sum;
		}

    }

    static public void reverseInPlace( double[] data)
    {
		int left  = 0;
		int right = data.length-1;

		while (left < right) {
			double temp = data[left];
			data[left]  = data[right];
			data[right] = temp;
			left++;
			right--;
		}
    }

	static public double[] normalise( double data[] )
    {
		double sum = 0.0;
		double[] a = new double[data.length];

		for ( int i = 0; i < data.length; i++ )
		{
			sum += data[i];
			a[i] = data[i];
		}

		for ( int i = 0; i < data.length; i++ )
		{
			a[i] /= sum;
		}

		return a;
    }

    static public double[] reverse( double[] data)
    {
		double[] a = new double[data.length];

		for ( int i = 0; i < data.length; i++ )
		{
			a[data.length-i-1] = data[i];
		}

		return a;
    }
	public static void main(String[] args)
	{
		double[] a = {1.0,2.0,3.0};
		reverse(a);
	}
}