Sort strings in lexicographic order Program plan: Main.java Create a class named “Main”. Inside the class, Define the “main ()” method. Declare and define array of strings Instantiate the class Call the method sort to array of strings. Display the resultant after printing. MergeSorter.java Create a class named “MergeSorter”. Inside the class, Declare the array of strings. Define the constructor. Initialize the array Define the method “Sort()”. Condition to compare the length of the string Assign the first half of the string Assign the second half of the string Loop that for both first half and second half of the string. Sort the first half of the string Sort the second half of the string Call the method merge to combine first and second half of the string. Define the method “merge()” Declare and define the required variables. Loop that iterates to place the smallest element at its position. Use appropriate conditions to place the values at the exact positions. In the same way both first half and second half is sorted and placed at the exact locations.

Question

Want to see the full answer?

Answer 1

Question

Chapter 14, Problem 4PE

Program Plan Intro

Sort strings in lexicographic order

Program plan:

Main.java

Create a class named “Main”. Inside the class,

Define the “main ()” method.

Declare and define array of strings

Instantiate the class

Call the method sort to array of strings.

Display the resultant after printing.

MergeSorter.java

Create a class named “MergeSorter”. Inside the class,

Declare the array of strings.

Define the constructor.

Initialize the array

Define the method “Sort()”.

Condition to compare the length of the string

Assign the first half of the string

Assign the second half of the string

Loop that for both first half and second half of the string.

Sort the first half of the string

Sort the second half of the string

Call the method merge to combine first and second half of the string.

Define the method “merge()”

Declare and define the required variables.

Loop that iterates to place the smallest element at its position.

Use appropriate conditions to place the values at the exact positions.

In the same way both first half and second half is sorted and placed at the exact locations.

Expert Solution & Answer

Want to see the full answer?

Check out a sample textbook solution

See solution

Students have asked these similar questions

Question D.4: FIFO Page Replacement Consider the following page reference string: e, c, b, e, a, g, d, c, e, g, d, a Considering 4 frames, fill in the following table and then answer how many page faults would occur with the FIFO page replacement algorithm. RS: reference string; FO: frame 0, F1: frame 1, etc. Hint: all frames are initially empty, so your first unique pages will all cost one fault each. Time 1234567891011 12 RS e cb e agd ce g d a FO F1 F2 F3 Page fault? b) Total # page faults: c) Briefly (1-2 sentences) explain Belady's Anomaly that can occur in FIFO Page Replacement.

Consider a system that uses a fixed-partition scheme, with equal partitions of size 2" bytes, and the main memory has 2¹8 bytes. A process table is maintained with a pointer to the resident partition for each resident process. How many bits are required for the pointer in the process table? Show all your steps.

Use the same semaphore notation shown above to describe how we can ensure the execution order of the following process execution graph: P6 P2 P7 P1 P3 P4 P5 Use all of the following semaphores in your answer: s1=0; s2=0; s3=0; s4=0; s5=0; s6=0;