Convert this java method to do ternary searches instead of binary searches...

public static int binarySearch$($Vector A$,$ int n$,$ int T$)\{$

int L $=0$;

int R $=$ n $-1$;

while $($L $<=$ R$)\{$

int m $=($L $+$ R$)/2$;

if $($A$.$get$($m$)<$ T$)\{$

L $=$ m $+1$;

$\}$ else if $($A$.$get$($m$)>$ T$)\{$

R $=$ m $-1$;

$\}$ else $\{$

$//$return the index of the given element

return m;

$\}$

$\}$

return $-1$;

$\}$