Java Homework Help: Data Structures and Algorithms 6th Edition

Create a Recursion Class that will implement the following recursive algorithms:

Implement a recursive algorithm to compute the n^th Harmonic number defined as:

Hn = signma(n, k=1) 1/k

Implement Isabels technique for summing the values in an array of n integers as described in problem C-5.24 on page 223 of the textbook.

The values to be summed by Isabels technique should be stored in an ASCII text file. You can create this file using a text editor like Notepad.

The values should be white space delimited in this file.

To call to Isabels technique your program needs to:

Request the path to the data file

Load the contents of the data file into an array

Call Isabels technique

As described in the text, Isabels technique only works for arrays that contain a power of 2 number of integers. If the number of integers in the data file are not a power of 2 your method must throw an appropriate exception.

Implement a recursive method with the signature

void list( Stringpath)

that prints all entries of the file system rooted at the given path.Note that a path would may look something like:C:\Windows\DigitalLocker.The list of entries should be displayed in the console and not in a JOptionPane.

Because the list of entries can be very long this method will print the list of entries to the console rather than return a list of entries.

Create a Client Class that will fully test each of the recursive methods that you created above in an interactive menu fashion. This class should:

Use a JOpitonPane to ask the user which algorithm they wish to test.

The user should be provided with a menu/list to select from

If the user selects an invalid option, the program should

Inform the user of their mistake and allow them to try again

The last option in the menu/list should allow the user to quit the program.

For each recursive technique, use a JOptionPane to ask the user for any parameters/values needed for the test.For Isabels technique the parameter should be the path that contains a blank (white space) separated list of integers values that will make up the array.

When you read in the values from the file you should skip any values that are not integers.

The presence of one or more on-integer values in the input file does not automatically make the file invalid. If the number of valid integer values in the file is a power of 2 then it is a valid input file.

If the input file does not contain a power of 2 number of valid integers your program should inform the user of the problem and ask them to enter a new filename or quit back to the algorithm selection menu.

If the user enters a file that does not exist your program should inform the user that the file does not exist and ask the user to enter a correct filename or quit back to algorithm selection menu.

The user should have the option of giving up on trying to run Isabels technique and if the user selects that option they should be returned to the main menu.

Output for each test should be shown in the system console and must include:

The name of the algorithm being tested.

The parameters entered by the user

Values used if different from parameters (e.g. the contents of the array read in for Isabels technique).

Error messages give to the user (e.g. file not found)

The results of the test.

Note that the JOptionPane interactions will not be captured in the system console.

At the end of a test the user should be given the options of running another test or exiting the program, i.e. after running one of the recursive algorithms the user should be returned to the main menu.

Isabel's Technique is as follows:

Isabel has an interesting way of summing up the values in an array A of n integers, where n is a power of two. She creates an array B of half the size of A and sets B[i] = A[2i] + A[2i + 1], for i = 0,1,...,(n/2)1. If B has size 1, then she outputs B[0]. Otherwise, she replaces A with B, and repeats the process. What is the running time of her algorithm?