Write a static method named vowelsBeforeconsonants that accepts an array of characters as a parameter and rearranges its elements so that all even vowels appear before the consonants. For example, if the following array is passed to your method: char[] numbers = {'r', 't', 'a', 'o', 'p', 'u'}; Then after the method has been called, one acceptable ordering of the elements would be: {'a', 'o', 'u', 'r', 't', 'p'} The exact order of the elements does not matter, so long as all vowels appear before all For example, the following would also be an acceptable ordering: consonants. {'o', 'a', 'u', 't', 'p', 'r'} 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 no even vowels or no consonants. You may assume that the array is not null. You may not use any temporary arrays to help you solve this problem. (But you may declare as many simple variables as you like, such as chars.) 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. 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 is a vowel and the right element is a consonant.
Write a static method named vowelsBeforeconsonants that accepts an array of characters as a parameter and rearranges its elements so that all even vowels appear before the consonants. For example, if the following array is passed to your method: char[] numbers = {'r', 't', 'a', 'o', 'p', 'u'}; Then after the method has been called, one acceptable ordering of the elements would be: {'a', 'o', 'u', 'r', 't', 'p'} The exact order of the elements does not matter, so long as all vowels appear before all For example, the following would also be an acceptable ordering: consonants. {'o', 'a', 'u', 't', 'p', 'r'} 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 no even vowels or no consonants. You may assume that the array is not null. You may not use any temporary arrays to help you solve this problem. (But you may declare as many simple variables as you like, such as chars.) 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. 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 is a vowel and the right element is a consonant.
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 vowelsBeforeconsonants that accepts an array of characters as a parameter and rearranges
its elements so that all even vowels appear before the consonants. For example, if the following array is passed to your
method:
char[] numbers = {'r', 't', 'a', 'o', 'p', 'u'};
Then after the method has been called, one acceptable ordering of the elements would be:
{'a', 'o', 'u', 'r', 't', 'p'}
The exact order of the elements does not matter, so long as all vowels appear before all
For example, the following would also be an acceptable ordering:
consonants.
{'o', 'a', 'u', 't', 'p', 'r'}
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 no even vowels or no consonants. You may assume that the array is not null.
You may not use any temporary arrays to help you solve this problem. (But you may declare as
many simple variables as you like, such as chars.) 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.
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 is a vowel and the right element is
a consonant.](/v2/_next/image?url=https%3A%2F%2Fcontent.bartleby.com%2Fqna-images%2Fquestion%2Fc4247586-c5ba-4193-bff0-fd146d066f71%2F701f8eb9-7d7f-4c5f-b574-d04aa4cea46e%2F1sc01w_processed.png&w=3840&q=75)
Transcribed Image Text:Write a static method named vowelsBeforeconsonants that accepts an array of characters as a parameter and rearranges
its elements so that all even vowels appear before the consonants. For example, if the following array is passed to your
method:
char[] numbers = {'r', 't', 'a', 'o', 'p', 'u'};
Then after the method has been called, one acceptable ordering of the elements would be:
{'a', 'o', 'u', 'r', 't', 'p'}
The exact order of the elements does not matter, so long as all vowels appear before all
For example, the following would also be an acceptable ordering:
consonants.
{'o', 'a', 'u', 't', 'p', 'r'}
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 no even vowels or no consonants. You may assume that the array is not null.
You may not use any temporary arrays to help you solve this problem. (But you may declare as
many simple variables as you like, such as chars.) 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.
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 is a vowel and the right element is
a consonant.
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 3 steps with 1 images
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