Here you can find the source of sort2(double v[], int v2[], int left, int right)
static void sort2(double v[], int v2[], int left, int right)
//package com.java2s; /*************************************************************************** * Program's name: acotsp/*from w w w .j a v a2 s . c om*/ * * Ant Colony Optimization algorithms (AS, ACS, EAS, RAS, MMAS, BWAS) for the * symmetric TSP * * Copyright (C) 2004 Thomas Stuetzle * * This program is free software; you can redistribute it and/or modify * it under the terms of the GNU General Public License as published by * the Free Software Foundation; either version 2 of the License, or * (at your option) any later version. * * This program is distributed in the hope that it will be useful, * but WITHOUT ANY WARRANTY; without even the implied warranty of * MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE. See the * GNU General Public License for more details. * * You should have received a copy of the GNU General Public License * along with this program; if not, write to the Free Software * Foundation, Inc., 59 Temple Place, Suite 330, Boston, MA 02111-1307 USA * * email: stuetzle no@spam informatik.tu-darmstadt.de * mail address: Universitaet Darmstadt * Fachbereich Informatik * Hochschulstr. 10 * D-64283 Darmstadt * Germany ***************************************************************************/ public class Main { static void sort2(double v[], int v2[], int left, int right) { int k, last; if (left >= right) return; swap2(v, v2, left, (left + right) / 2); last = left; for (k = left + 1; k <= right; k++) if (v[k] < v[left]) swap2(v, v2, ++last, k); swap2(v, v2, left, last); sort2(v, v2, left, last); sort2(v, v2, last + 1, right); } static void swap2(double v[], int v2[], int i, int j) { double tmp1; int tmp2; tmp1 = v[i]; v[i] = v[j]; v[j] = tmp1; tmp2 = v2[i]; v2[i] = v2[j]; v2[j] = tmp2; } }