test4

Class Test4C

java.lang.Object

test4.Test4C

public class Test4C
extends Object

Method Summary

Modifier and Type	Method and Description
static String	doubler(String s) Returns the string formed by repeating each character in the specified string.
static String	flipCase(String s) Returns a string where the case of each letter is flipped compared to the corresponding letter in s.
static void	repair(List<Integer> t) Sorts the elements of the list t so that the elements are in ascending order.
static int	wheresWaldo(Waldo waldo, int locA, int locB) Returns the location of Waldo given two guesses of Waldo's location.

Methods inherited from class java.lang.Object

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

Method Detail

doubler

public static String doubler(String s)

Returns the string formed by repeating each character in the specified string. For example:

 doubler("")     returns the string equal to ""
 doubler("a")    returns the string equal to "aa"
 doubler("xy")   returns the string equal to "xxyy"
 doubler("big")  returns the string equal to "bbiigg"
 doubler("EECS") returns the string equal to "EEEECCSS"
 

Parameters:

s - a string

Returns:

the string formed by repeating each character in the specified string

flipCase

public static String flipCase(String s)

Returns a string where the case of each letter is flipped compared to the corresponding letter in s. The empty string is returned if s is equal to the empty string. For example:

 flipCase("")           returns the string equal to ""
 flipCase("a")          returns the string equal to "A"
 flipCase("A")          returns the string equal to "a"
 flipCase("abCd")       returns the string equal to "ABcD"
 flipCase("CAMELcASE")  returns the string equal to "camelCase"
 

Parameters:

s - a string consisting of English letter characters

Returns:

a string where the case of each letter is flipped compared to the corresponding letter in s

repair

public static void repair(List<Integer> t)

Sorts the elements of the list t so that the elements are in ascending order. A precondition of this method is that t must be already sorted in ascending order except that adjacent pairs of elements in t may be out of order. Consider the following almost sorted lists:

 [1, 0]                1, 0 is out of order
 [0, 2, 1]             2, 1 is out of order
 [0, 2, 1, 3]          2, 1 is out of order
 [0, 2, 1, 4, 3]       2, 1 and 4, 3 are out of order
 [0, 1, 3, 2, 4]       3, 2 is out of order
 

This method switches the positions of the out-of-order adjacent elements thus repairing the list so that it is in sorted order.

Parameters:

t - a list of almost sorted elements

Precondition:

t is sorted in ascending order except that adjacent pairs of elements may be out of order

wheresWaldo

public static int wheresWaldo(Waldo waldo,
                              int locA,
                              int locB)

Returns the location of Waldo given two guesses of Waldo's location. Waldo's location is an integer value somewhere between Integer.MIN_VALUE and Integer.MAX_VALUE. Only Waldo knows Waldo's location, and Waldo is not willing to give his exact location to anyone; however, Waldo is willing to tell a client which of two guesses is closer to his location (see the closer method in the Waldo class).

This method can find Waldo's location using 32 or fewer recursive calls (i.e., it does not check every possible location for Waldo).

Parameters:

waldo - a reference to a Waldo object

locA - a guess of Waldo's location

locB - a guess of Waldo's location

Returns:

Waldo's exact location

Precondition:

locA is less than or equal to locB