Write a static method named joiner that accepts two arrays of strings al and a2 as parameters and returns a new array a3 such that each element of a3 at each index i stores a new string composed of the words stored at al[i] and a2[i] joined together with the word with the work having greater length (more characters) at the front of the concatenated string. If there is a tie, take the element from al. For example, if al and a2 store the following elements: String [] al String[] a2 {"star", "pie", "jelly bean", "car"}; {"cookie", "fig", "banana", "soda"}; Then your method should return the new array: {"cookiestar", "piefig", "jelly beanbanana", "sodacar"}. If the arrays al and a2 are not the same length, the result returned by your method should have as many elements as the shorter of the two arrays. For example, if al and a2 store the following elements: String [] al = {"Splinter", "Leo", "April", "Don", "Raph"}; String [] a2 {"Krang", "Shredder", "Bebop"}; Then your method should return the new array: {"SplinterKrang", "ShredderLeo", "AprilBebop"}. For full credit, do not modify the elements of al or a2. Do not make any assumptions about the length of al or a2 or the length of the strings. You may assume that neither array is null and that no element of either array is null.
Write a static method named joiner that accepts two arrays of strings al and a2 as parameters and returns a new array a3 such that each element of a3 at each index i stores a new string composed of the words stored at al[i] and a2[i] joined together with the word with the work having greater length (more characters) at the front of the concatenated string. If there is a tie, take the element from al. For example, if al and a2 store the following elements: String [] al String[] a2 {"star", "pie", "jelly bean", "car"}; {"cookie", "fig", "banana", "soda"}; Then your method should return the new array: {"cookiestar", "piefig", "jelly beanbanana", "sodacar"}. If the arrays al and a2 are not the same length, the result returned by your method should have as many elements as the shorter of the two arrays. For example, if al and a2 store the following elements: String [] al = {"Splinter", "Leo", "April", "Don", "Raph"}; String [] a2 {"Krang", "Shredder", "Bebop"}; Then your method should return the new array: {"SplinterKrang", "ShredderLeo", "AprilBebop"}. For full credit, do not modify the elements of al or a2. Do not make any assumptions about the length of al or a2 or the length of the strings. You may assume that neither array is null and that no element of either array is null.
Database System Concepts
7th Edition
ISBN:9780078022159
Author:Abraham Silberschatz Professor, Henry F. Korth, S. Sudarshan
Publisher:Abraham Silberschatz Professor, Henry F. Korth, S. Sudarshan
Chapter1: Introduction
Section: Chapter Questions
Problem 1PE
Related questions
Question
![Write a static method named joiner that accepts two arrays of strings al and a2 as parameters and returns a new array a3
such that each element of a3 at each index i stores a new string composed of the words stored at al[i] and a2[i] joined
together with the word with the work having greater length (more characters) at the front of the concatenated string. If there
is a tie, take the element from al.
For example, if al and a2 store the following elements:
String [] al
String [] a2
{"star", "pie", "jelly bean", "car"};
{"cookie", "fig", "banana", "soda"};
Then your method should return the new array:
{"cookiestar", "piefig", "jelly beanbanana", "sodacar"}.
If the arrays al and a2 are not the same length, the result returned by your method should have as many elements as the
shorter of the two arrays. For example, if al and a2 store the following elements:
String[] al
String[] a2
{"Splinter", "Leo", "April", "Don", "Raph"};
{"Krang", "Shredder", "Bebop"};
Then your method should return the new array:
{"SplinterKrang", "ShredderLeo", "AprilBebop"}.
For full credit, do not modify the elements of al or a2. Do not make any assumptions about the length of al or a2 or the
length of the strings. You may assume that neither array is null and that no element of either array is null.](/v2/_next/image?url=https%3A%2F%2Fcontent.bartleby.com%2Fqna-images%2Fquestion%2Fc4247586-c5ba-4193-bff0-fd146d066f71%2Ffcb9f99a-c849-4b37-ba67-ce0df0e19e4f%2Few5d7mm_processed.png&w=3840&q=75)
Transcribed Image Text:Write a static method named joiner that accepts two arrays of strings al and a2 as parameters and returns a new array a3
such that each element of a3 at each index i stores a new string composed of the words stored at al[i] and a2[i] joined
together with the word with the work having greater length (more characters) at the front of the concatenated string. If there
is a tie, take the element from al.
For example, if al and a2 store the following elements:
String [] al
String [] a2
{"star", "pie", "jelly bean", "car"};
{"cookie", "fig", "banana", "soda"};
Then your method should return the new array:
{"cookiestar", "piefig", "jelly beanbanana", "sodacar"}.
If the arrays al and a2 are not the same length, the result returned by your method should have as many elements as the
shorter of the two arrays. For example, if al and a2 store the following elements:
String[] al
String[] a2
{"Splinter", "Leo", "April", "Don", "Raph"};
{"Krang", "Shredder", "Bebop"};
Then your method should return the new array:
{"SplinterKrang", "ShredderLeo", "AprilBebop"}.
For full credit, do not modify the elements of al or a2. Do not make any assumptions about the length of al or a2 or the
length of the strings. You may assume that neither array is null and that no element of either array is null.
Expert Solution
This question has been solved!
Explore an expertly crafted, step-by-step solution for a thorough understanding of key concepts.
This is a popular solution!
Trending now
This is a popular solution!
Step by step
Solved in 2 steps
Knowledge Booster
Learn more about
Need a deep-dive on the concept behind this application? Look no further. Learn more about this topic, computer-science and related others by exploring similar questions and additional content below.Recommended textbooks for you
Database System Concepts
Computer Science
ISBN:
9780078022159
Author:
Abraham Silberschatz Professor, Henry F. Korth, S. Sudarshan
Publisher:
McGraw-Hill Education
Starting Out with Python (4th Edition)
Computer Science
ISBN:
9780134444321
Author:
Tony Gaddis
Publisher:
PEARSON
Digital Fundamentals (11th Edition)
Computer Science
ISBN:
9780132737968
Author:
Thomas L. Floyd
Publisher:
PEARSON
Database System Concepts
Computer Science
ISBN:
9780078022159
Author:
Abraham Silberschatz Professor, Henry F. Korth, S. Sudarshan
Publisher:
McGraw-Hill Education
Starting Out with Python (4th Edition)
Computer Science
ISBN:
9780134444321
Author:
Tony Gaddis
Publisher:
PEARSON
Digital Fundamentals (11th Edition)
Computer Science
ISBN:
9780132737968
Author:
Thomas L. Floyd
Publisher:
PEARSON
C How to Program (8th Edition)
Computer Science
ISBN:
9780133976892
Author:
Paul J. Deitel, Harvey Deitel
Publisher:
PEARSON
Database Systems: Design, Implementation, & Manag…
Computer Science
ISBN:
9781337627900
Author:
Carlos Coronel, Steven Morris
Publisher:
Cengage Learning
Programmable Logic Controllers
Computer Science
ISBN:
9780073373843
Author:
Frank D. Petruzella
Publisher:
McGraw-Hill Education