Question

implement please...

...........................................

public class TernarySearch

{

    /** Task: Searches for a value in an array.

     * @param a an array of Comparable objects

     * @param desiredItem an item to search for   

     * @param n an integer > 0

     */

    public static <T extends Comparable<? super T>>

    boolean ternarySearch(T[] a, T desiredItem, int n)

    {

        // it is assumed that the data is already sorted

        return ternarySearch(a, 0, n-1, desiredItem);

    } // end ternarySearch

    /** Task: recursive ternarySearch search through an array of objects.

     * @param a an array of Comparable objects

     * @param desiredItem an item to search for   

     * @param left an integer >= 0

     * @param right an integer > left and < a.length

     */

    public static <T extends Comparable<? super T>>

    boolean ternarySearch(T[] a, int left, int right, T desiredItem )

    {

        // TODO Project 1

        return false;

    } // end ternarySearch

    public static void main(String[] args)

    {

        ArrayList<Integer> accounts = new ArrayList<Integer>();

        try

        {

            Scanner file = new Scanner(new File("accounts.txt"));

            while (file.hasNext()) // test for the end of the file

            {

                // read a line

                try

                {

                    accounts.add(file.nextInt());

                } catch (NumberFormatException nfe)

                {

                    System.out.println("Error in input file ignoring");

                }

            }

            // release resources associated with flights.txt

            file.close();

            // print the accounts read

            System.out.println("Accounts are:");

            for (int index = 0; index < accounts.size(); index++)

            {

                System.out.println("[" + index + "] " + accounts.get(index));

            }

            Integer[] accountsU = accounts.toArray(new Integer[accounts.size()]);

            Integer[] accountsS = Arrays.copyOf(accountsU, accountsU.length);

            Arrays.sort(accountsS);

            System.out.println("Sorted accounts are:");

            for (int index = 0; index < accountsS.length; index++)

            {

                System.out.println("[" + index + "] " + accountsS[index]);

            }

            boolean foundT = ternarySearch(accountsS, 7881200, accountsS.length);

            int foundB = Arrays.binarySearch(accountsS, 7881200);

            System.out.println("\nternarySearch: element 7881200 is found " + foundT);

            if (foundT && foundB >= 0 || !foundT && foundB < 0)

                System.out.println("   PASS");

            else

                System.out.println("\u001B[35m\u001B[1m   FAIL\u001B[0m");

            foundT = ternarySearch(accountsS, 7881199, accountsS.length);

            foundB = Arrays.binarySearch(accountsS, 7881199);

            System.out.println("\nternarySearch: element 7881199 is found " + foundT);

            if (foundT && foundB >= 0 || !foundT && foundB < 0)

                System.out.println("   PASS");

            else

                System.out.println("\u001B[35m\u001B[1m   FAIL\u001B[0m");

            foundT = ternarySearch(accountsS, 7881201, accountsS.length);

            foundB = Arrays.binarySearch(accountsS, 7881201);

            System.out.println("\nternarySearch: element 7881201 is found " + foundT);

            if (foundT && foundB >= 0 || !foundT && foundB < 0)

                System.out.println("   PASS");

            else

                System.out.println("\u001B[35m\u001B[1m   FAIL\u001B[0m");

            foundT = ternarySearch(accountsS, 2222222, accountsS.length);

            foundB = Arrays.binarySearch(accountsS, 2222222);

            System.out.println("\nternarySearch: element 2222222 is found " + foundT);

            if (foundT && foundB >= 0 || !foundT && foundB < 0)

                System.out.println("   PASS");

            else

                System.out.println("\u001B[35m\u001B[1m   FAIL\u001B[0m");

            foundT = ternarySearch(accountsS, 9999999, accountsS.length);

            foundB = Arrays.binarySearch(accountsS, 9999999);

            System.out.println("\nternarySearch: element 9999999 is found " + foundT);

            if (foundT && foundB >= 0 || !foundT && foundB < 0)

                System.out.println("   PASS");

            else

                System.out.println("\u001B[35m\u001B[1m   FAIL\u001B[0m");

            foundT = ternarySearch(accountsS, 0000000, accountsS.length);

            foundB = Arrays.binarySearch(accountsS, 0000000);

            System.out.println("\nternarySearch: element 0000000 is found " + foundT);

            if (foundT && foundB >= 0 || !foundT && foundB < 0)

                System.out.println("   PASS");

            else

                System.out.println("\u001B[35m\u001B[1m   FAIL\u001B[0m");

            foundT = ternarySearch(accountsS, 1111111, accountsS.length);

            foundB = Arrays.binarySearch(accountsS, 1111111);

            System.out.println("\nternarySearch: element 1111111 is found " + foundT);

            if (foundT && foundB >= 0 || !foundT && foundB < 0)

                System.out.println("   PASS");

            else

                System.out.println("\u001B[35m\u001B[1m   FAIL\u001B[0m");

            foundT = ternarySearch(accountsS, 1005231, accountsS.length);

            foundB = Arrays.binarySearch(accountsS, 1005231);

            System.out.println("\nternarySearch: element 1005231 is found " + foundT);

            if (foundT && foundB >= 0 || !foundT && foundB < 0)

                System.out.println("   PASS");

Answer 1

JAVA program screenshots for the provided problem statement

Input file screenshot

JAVA program output screenshots