Answered step by step
Verified Expert Solution
Link Copied!

Question

1 Approved Answer

Task 4 (15 pts.) The program task4.java given below is an incomplete program. The goal of the program is to: 1. Ask the user to

image text in transcribedimage text in transcribedimage text in transcribedimage text in transcribedimage text in transcribed

Task 4 (15 pts.) The program task4.java given below is an incomplete program. The goal of the program is to: 1. Ask the user to enter the name of an input text file. 2. Create an array list called input_list, containing as items the lines of the input text file. 3. Create an empty array list of strings, called output_list 4. Insert into that array list the items of input list, one by one. Insertions should be done in such a way that, after each insertion, the strings in the array list are sorted in ascending order of their length. In other words, shorter strings should appear before longer strings Complete that program, by defining an insert_before_longer function, that satisfies the following specs: Function insert before_longer takes two arguments, called A, x. Argument A is an array list of strings, and argument x is a string before that element. x should be inserted at position 2, right before element "elephant". After the insertion, A should The function should look for the first element of A that is longer in length than x, and insert x right For example, if A contains elements "cat", "whale", "elephant", in that order, and x "donkey", then contain elements "cat", "whale", "donkey", "elephant", in that order

Step by Step Solution

There are 3 Steps involved in it

Step: 1

blur-text-image

Get Instant Access to Expert-Tailored Solutions

See step-by-step solutions with expert insights and AI powered tools for academic success

Step: 2

blur-text-image

Step: 3

blur-text-image

Ace Your Homework with AI

Get the answers you need in no time with our AI-driven, step-by-step assistance

Get Started

Recommended Textbook for

Oracle 12c SQL

Authors: Joan Casteel

3rd edition

1305251032, 978-1305251038

More Books

Students also viewed these Databases questions