keel.Algorithms.Discretizers.UCPD

Class Quicksort

java.lang.Object

keel.Algorithms.Discretizers.UCPD.Quicksort

public class Quicksort
extends java.lang.Object

This class implements the Quicksort algorithm. It lets sort an array of values from lowest to highest and vice versa basing on an option

Since:

JDK1.6

Version:

1.0

Author:

Written by Jose A. Saez (University of Granada), 21/12/2009

Field Summary

Fields

Modifier and Type	Field and Description
static int	HIGHEST_FIRST Configuration tags.
static int	LOWEST_FIRST Configuration tags.

Constructor Summary

Constructors

Constructor and Description
Quicksort()

Method Summary

Modifier and Type	Method and Description
static int[]	sort(double[] vector, int size, int opt) It sorts the values array basing on opt

Methods inherited from class java.lang.Object

clone, equals, finalize, getClass, hashCode, notify, notifyAll, toString, wait, wait, wait

Field Detail

LOWEST_FIRST

public static final int LOWEST_FIRST

Configuration tags.

See Also:

Constant Field Values

HIGHEST_FIRST

public static final int HIGHEST_FIRST

Configuration tags.

See Also:

Constant Field Values

Constructor Detail

Quicksort

public Quicksort()

Method Detail

sort

public static int[] sort(double[] vector,
                         int size,
                         int opt)

It sorts the values array basing on opt

Parameters:

vector - double values array to sort

size - number of elements to sort

opt - equals to HIGHEST_FIRST to sort from highest to lowest, and equals to LOWEST_FIRST to sort from lowest to highest

Returns:

array of positions for each value (for example, the first value of the array represents the original position of the element in the original array to sort)