quicksort.cc

模糊聚类分析的源程序！

//**************************************************************
//*   filename: quicksort.cc                                   *
//*                                                            *
//**************************************************************
//* programmed by: Oliver Wagner                               *
//* last change: 08-02-95                                      *
//**************************************************************
#include "quicksort.h"

char Groesser (char *Das, char *AlsDas);
void Quicksort (char **Das, int von, int bis);

char 
Groesser (char *Das, char *AlsDas)
{
  char Result = 1;
  int i = 0;

  while ((Das[i] == AlsDas[i]) &&
	 (Das[i] != '\0') &&
	 (AlsDas[i] != '\0')) {
    i++;
  }
  if ((Das[i] < AlsDas[i]) || (Das[i] == '\0'))
    Result = 0;

  return (Result);
}

void 
quicksort (char **me, int number)
{
  Quicksort (me, 0, number - 1);
}

void 
Quicksort (char **Das, int von, int bis)
{
  int r, i, j;

  char *StringBuffer, *TestString;

  if (bis > von) {
    i = von;
    j = bis;
    /* Waehle r einmal in der Mitte */
    r = (von + bis) / 2;
    TestString = Das[r];
    do {
      while (Groesser (TestString, Das[i]))
	i++;
      while (Groesser (Das[j], TestString))
	j--;
      if (i <= j) {
	StringBuffer = Das[i];
	Das[i] = Das[j];
	Das[j] = StringBuffer;
	i++;
	j--;
      }
    } while (j >= i);
    Quicksort (Das, von, j);
    Quicksort (Das, i, bis);
  }
};

void 
quicksort (DVektor & dvektor, IVektor & ivektor)
{
}