Ascending and descending order Program plan: Import necessary package. Create a class “AscendingAndDescending”, Define the method “main ()”, Declare the necessary variables. Create “Scanner” object. Prompt the user to enter three integers. Get three integers from the user using “nextInt()”. Check whether the first integer is less than or equal to the remaining integers, If it is true, assign the first integer to “low1”. Check whether the second integer is less than or equal to the third integer, If it is true, assign the second integer to medium. Assign the third integer to “high1”. Otherwise, Assign the third integer to “medium”. Assign the second integer to “high1”. Otherwise, Check whether the second integer is less than or equal to the remaining integers, If it is true, assign the second integer to “low1”. Check whether the first integer is less than or equal to third integer, If it is true, assign the first integer to “medium”. Assign the third integer to “high1”. Otherwise, Assign the third integer to “medium”. Assign the first integer to “high1”. Otherwise, Assign the third integer to “low1”. Check whether the first integer is less than or equal to second integer, If it is true, assign the first integer to “medium”. Assign the second integer to “high1”. Otherwise, Assign the second integer to “medium”. Assign the first integer to “high1”. Print the integers in ascending order. Print the integers in descending order.

Question

Exercise docID document text docID document text 1 hot chocolate cocoa beans 7 sweet sugar 2345 9 cocoa ghana africa 8 sugar cane brazil beans harvest ghana 9 sweet sugar beet cocoa butter butter truffles sweet chocolate 10 sweet cake icing 11 cake black forest Clustering by k-means, with preprocessing tokenization, term weighting TFIDF. Manhattan Distance. Number of cluster is 2. Centroid docID 2 and docID 9.

Answer 1

Question

Chapter 5, Problem 2PE

Program Plan Intro

Ascending and descending order

Program plan:

Import necessary package.

Create a class “AscendingAndDescending”,

Define the method “main ()”,

Declare the necessary variables.

Create “Scanner” object.

Prompt the user to enter three integers.

Get three integers from the user using “nextInt()”.

Check whether the first integer is less than or equal to the remaining integers,

If it is true, assign the first integer to “low1”.

Check whether the second integer is less than or equal to the third integer,

If it is true, assign the second integer to medium.

Assign the third integer to “high1”.

Otherwise,

Assign the third integer to “medium”.

Assign the second integer to “high1”.

Otherwise,

Check whether the second integer is less than or equal to the remaining integers,

If it is true, assign the second integer to “low1”.

Check whether the first integer is less than or equal to third integer,

If it is true, assign the first integer to “medium”.

Assign the third integer to “high1”.

Otherwise,

Assign the third integer to “medium”.

Assign the first integer to “high1”.

Otherwise,

Assign the third integer to “low1”.

Check whether the first integer is less than or equal to second integer,

If it is true, assign the first integer to “medium”.

Assign the second integer to “high1”.

Otherwise,

Assign the second integer to “medium”.

Assign the first integer to “high1”.

Print the integers in ascending order.

Print the integers in descending order.

Expert Solution & Answer

Trending nowThis is a popular solution!

See solution

Check out sample textbook solution

Students have asked these similar questions

Exercise docID document text docID document text 1 hot chocolate cocoa beans 7 sweet sugar 2345 9 cocoa ghana africa 8 sugar cane brazil beans harvest ghana 9 sweet sugar beet cocoa butter butter truffles sweet chocolate 10 sweet cake icing 11 cake black forest Clustering by k-means, with preprocessing tokenization, term weighting TFIDF. Manhattan Distance. Number of cluster is 2. Centroid docID 2 and docID 9.

Change the following code so that there is always at least one way to get from the left corner to the top right, but the labyrinth is still randomized. The player starts at the bottom left corner of the labyrinth. He has to get to the top right corner of the labyrinth as fast he can, avoiding a meeting with the evil dragon. Take care that the player and the dragon cannot start off on walls. Also the dragon starts off from a randomly chosen position public class Labyrinth { private final int size; private final Cell[][] grid; public Labyrinth(int size) { this.size = size; this.grid = new Cell[size][size]; generateLabyrinth(); } private void generateLabyrinth() { Random rand = new Random(); for (int i = 0; i < size; i++) { for (int j = 0; j < size; j++) { // Randomly create walls and paths grid[i][j] = new Cell(rand.nextBoolean()); } } // Ensure start and end are…

Change the following code so that it checks the following 3 conditions: 1. there is no space between each cells (imgs) 2. even if it is resized, the components wouldn't disappear 3. The GameGUI JPanel takes all the JFrame space, so that there shouldn't be extra space appearing in the frame other than the game. Main(): Labyrinth labyrinth = new Labyrinth(10); Player player = new Player(9, 0); Dragon dragon = new Dragon(9, 9); JFrame frame = new JFrame("Labyrinth Game"); GameGUI gui = new GameGUI(labyrinth, player, dragon); frame.add(gui); frame.setSize(600, 600); frame.setDefaultCloseOperation(JFrame.EXIT_ON_CLOSE); frame.setVisible(true); public class GameGUI extends JPanel { private final Labyrinth labyrinth; private final Player player; private final Dragon dragon; //labyrinth, player, dragon are just public classes private final ImageIcon playerIcon = new ImageIcon("data/images/player.png");…