Interface TestingFunctions

public interface TestingFunctions

Method Summary

Modifier and Type	Method and Description
int	greatestCommonDivisor(int a, int b) This method calculates and returns the GCD of a and b using a binary calculation method based on the pseudo code retrieved from Wikipedia on 4/5/18 (original pseudo code show below method)
void	reverseWindow(int[] arr, int index1, int index2) This method reverses the subsection of the passed array defined by index1 and index2.

Method Detail

greatestCommonDivisor

int greatestCommonDivisor(int a,
                          int b)

This method calculates and returns the GCD of a and b using a binary calculation method based on the pseudo code retrieved from Wikipedia on 4/5/18 (original pseudo code show below method)

Parameters:

a - - the first integer, must be positive

b - - the second integer, must be positive

Returns:

gcd of a and b, if a or b is negative returns -1

reverseWindow

void reverseWindow(int[] arr,
                   int index1,
                   int index2)
            throws java.lang.IndexOutOfBoundsException

This method reverses the subsection of the passed array defined by index1 and index2. index2 is non-inclusive and will not be swapped with index1. If index1 > index2 then the two indexes will be swapped before they are checked for validity.

Parameters:

arr - - the array to reverse

index1 - - the first index of the subsection

index2 - - the non-inclusive upper bound of the subsection, last element swapped will be at the index (index2 - 1)

Throws:

java.lang.IndexOutOfBoundsException - if index1 or (index2) are not valid indexes of arr