Write a static method named "bigBeforeSmall" that accepts an array of Strings as a parameter and rearranges its elements so that longer Strings appear before shorter Strings.  For example, if the following array is passed to your method: String[] numbers = { "one", "twelve", "three", "four", "fourteen", "six" }; Then after the method has been called, one acceptable ordering of the elements would be:   ["fourteen", "twelve", "three", "four", "one", "six" ] The exact order of the elements does not matter, so long as all longer Strings appear before all shorter Strings.  Another acceptable order would be:  ["fourteen", "twelve", "three", "four", "six", "one" ] Do not make any assumptions about the length of the array or the range of values it might contain.  For example, the array might contain empty Strings (length zero), or all Strings could have the same length.  You may assume that the array is not null (empty). Hint: This is actually a sorting problem.  In BubbleSort you tested pairs of elements and swapped them if the left element is larger than the right element.  In this problem, the swap happens when the left element has fewer characters than the right element. You also may not use any other data structures such as the ArrayList class from Chapter 10.  DO NOT use Arrays.sort in your solution. You may use the following code to test your program:   If your method is modeled after a bubble sort, expected output is:           ["fourteen", "twelve", "three", "four", "one", "six" ] import java.util.*; public class BigOnesFirst {   public static void main(String[] args) {     String[] numbers = {"one", "twelve", "three", "four", "fourteen", "six"};     bigBeforeSmall(numbers);     System.out.println(Arrays.toString(numbers));   }   // *** Your method code goes here ***   } // End of BigOnesFirst class

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
icon
Related questions
Question

Write a static method named "bigBeforeSmall" that accepts an array of Strings as a parameter and rearranges its elements so that longer Strings appear before shorter Strings.  For example, if the following array is passed to your method:

String[] numbers = { "one", "twelve", "three", "four", "fourteen", "six" };

Then after the method has been called, one acceptable ordering of the elements would be:

  ["fourteen", "twelve", "three", "four", "one", "six" ]

The exact order of the elements does not matter, so long as all longer Strings appear before all shorter Strings.  Another acceptable order would be:

 ["fourteen", "twelve", "three", "four", "six", "one" ]

Do not make any assumptions about the length of the array or the range of values it might contain.  For example, the array might contain empty Strings (length zero), or all Strings could have the same length.  You may assume that the array is not null (empty).

Hint: This is actually a sorting problem.  In BubbleSort you tested pairs of elements and swapped them if the left element is larger than the right element.  In this problem, the swap happens when the left element has fewer characters than the right element.

You also may not use any other data structures such as the ArrayList class from Chapter 10. 
DO NOT use Arrays.sort in your solution.

You may use the following code to test your program:
  If your method is modeled after a bubble sort, expected output is:
          ["fourteen", "twelve", "three", "four", "one", "six" ]

import java.util.*;
public class BigOnesFirst {
  public static void main(String[] args) {
    String[] numbers = {"one", "twelve", "three", "four", "fourteen", "six"};
    bigBeforeSmall(numbers);
    System.out.println(Arrays.toString(numbers));
  }

  // *** Your method code goes here ***

 

} // End of BigOnesFirst class

 

Expert Solution
trending now

Trending now

This is a popular solution!

steps

Step by step

Solved in 2 steps with 1 images

Blurred answer
Knowledge Booster
Arrays
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.
Similar questions
  • SEE MORE QUESTIONS
Recommended textbooks for you
Database System Concepts
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)
Starting Out with Python (4th Edition)
Computer Science
ISBN:
9780134444321
Author:
Tony Gaddis
Publisher:
PEARSON
Digital Fundamentals (11th Edition)
Digital Fundamentals (11th Edition)
Computer Science
ISBN:
9780132737968
Author:
Thomas L. Floyd
Publisher:
PEARSON
C How to Program (8th Edition)
C How to Program (8th Edition)
Computer Science
ISBN:
9780133976892
Author:
Paul J. Deitel, Harvey Deitel
Publisher:
PEARSON
Database Systems: Design, Implementation, & Manag…
Database Systems: Design, Implementation, & Manag…
Computer Science
ISBN:
9781337627900
Author:
Carlos Coronel, Steven Morris
Publisher:
Cengage Learning
Programmable Logic Controllers
Programmable Logic Controllers
Computer Science
ISBN:
9780073373843
Author:
Frank D. Petruzella
Publisher:
McGraw-Hill Education