Java Array Min Value minFastSort(double x[], int idx[], int n, int m)

Here you can find the source of minFastSort(double x[], int idx[], int n, int m)

  1. HOME
  2. Java
  3. A
  4. Array Min Value
  5. minFastSort(double x[], int idx[], int n, int m)

Description

min Fast Sort

License

Open Source License

Declaration 

public static void minFastSort(double x[], int idx[], int n, int m)

Method Source Code

//package com.java2s;
//  it under the terms of the GNU Lesser General Public License as published by

public class Main {
    public static void minFastSort(double x[], int idx[], int n, int m) {
        for (int i = 0; i < m; i++) {
            for (int j = i + 1; j < n; j++) {
                if (x[i] > x[j]) {
                    double temp = x[i];
                    x[i] = x[j];/*from  www  .  j  av  a2s . co m*/
                    x[j] = temp;
                    int id = idx[i];
                    idx[i] = idx[j];
                    idx[j] = id;
                }
            }
        }
    }
}

Related

  1. minDistance(int[][] colors, int len, int[] color)
  2. minDouble(double a, double... others)
  3. minDouble(double... values)
  4. minDoubleArray(double[] data)
  5. minElement(int[] array)
  6. minFastSort(double[] x, int[] idx, int size)
  7. minIdx(int[] in)
  8. minIgnoreIndex(double[] array, int indexToIgnore)
  9. minimum(char[] set)