org.drip.spaces.big

Class BigR1Array

java.lang.Object

org.drip.spaces.big.BigR1Array

public class BigR1Array
extends java.lang.Object

BigR1Array contains an Implementation of a variety of in-place Sorting Algorithms for Big Double Arrays. - C A R Hoare's Quick Sort - J von Neumann's Merge Sort - R W Floyd's Heap Sort - Insertion Sort

Author:

Lakshmi Krishnamurthy

Constructor Summary

Constructors

Constructor and Description
BigR1Array(double[] adblA) BigR1Array Constructor

Method Summary

Modifier and Type	Method and Description
double[]	array() Retrieve the Array Contents
boolean	heapSort() Heap Sort the Big Array
boolean	insertionSort() Insertion Sort the Big Array
boolean	mergeSort() In-place Big Array Merge Sort
boolean	mergeSort(int iStart, int iEnd) Contiguous Stretch Merge Sort
boolean	mergeSort(int i1Start, int i1End, int i2Start, int i2End) Merge the Sorted Sub Array Pair
boolean	quickSort() Sort the Full Array using Quick Sort
boolean	quickSort(int iLow, int iHigh) Sort the Specified Range in the Array using Quick Sort
boolean	transfer(int iPickupIndex, int iDropOffIndex) Transfer all Elements from the Pickup Index to the Drop Off Index, and contiguously Shift the Intermediate Array

Methods inherited from class java.lang.Object

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

Constructor Detail

BigR1Array

public BigR1Array(double[] adblA)
           throws java.lang.Exception

BigR1Array Constructor

Parameters:

adblA - The Array to be Sorted

Throws:

java.lang.Exception - Thrown if the Inputs are Invalid

Method Detail

array

public double[] array()

Retrieve the Array Contents

Returns:

The Array Contents

transfer

public boolean transfer(int iPickupIndex,
                        int iDropOffIndex)

Transfer all Elements from the Pickup Index to the Drop Off Index, and contiguously Shift the Intermediate Array

Parameters:

iPickupIndex - The Pickup Index

iDropOffIndex - The Drop off Index

Returns:

TRUE - Successfully transferred the Pickup to the Drop off Locations and the related Translations

quickSort

public boolean quickSort(int iLow,
                         int iHigh)

Sort the Specified Range in the Array using Quick Sort

Parameters:

iLow - Lower Index of the Range (Inclusive)

iHigh - Upper Index of the Range (Inclusive)

Returns:

TRUE - The Range has been successfully sorted

quickSort

public boolean quickSort()

Sort the Full Array using Quick Sort

Returns:

TRUE - The Full Array has been successfully sorted

mergeSort

public boolean mergeSort(int i1Start,
                         int i1End,
                         int i2Start,
                         int i2End)

Merge the Sorted Sub Array Pair

Parameters:

i1Start - The Left Starting Index (Inclusive)

i1End - The Left Ending Index (Inclusive)

i2Start - The Right Starting Index (Inclusive)

i2End - The Right End Index (Inclusive)

Returns:

TRUE - Successfully Merged the Sorted Array Pair and Re-assigned Back to the Master

mergeSort

public boolean mergeSort(int iStart,
                         int iEnd)

Contiguous Stretch Merge Sort

Parameters:

iStart - The Master Starting Index (Inclusive)

iEnd - The Master Ending Index (Inclusive)

Returns:

TRUE - Successfully Merged the Sorted Array Stretch and Re-assigned Back to the Master

mergeSort

public boolean mergeSort()

In-place Big Array Merge Sort

Returns:

TRUE - Successfully Merged the Big Double Array and Re-assigned Back to the Master

heapSort

public boolean heapSort()

Heap Sort the Big Array

Returns:

TRUE - Successfully Merged the Big Double Array and Re-assigned Back to the Master

insertionSort

public boolean insertionSort()

Insertion Sort the Big Array

Returns:

TRUE - Successfully Merged the Big Double Array and Re-assigned Back to the Master