How do I sort tiles from least valuable to most valuable? import java.util.ArrayList; class Rack { private ArrayList Tile; public Rack() { Tile = new ArrayList(); } public void addTile(Tile t) { Tile.add(t); } public String toString() { String str = ""; for(int i=0; i < Tile.size() ; i++) str = str + Tile.get(i); return str; } public void sortHighToLow() { int i, j, min; int n = Tile.size(); for (i = 0; i < n-1; i++) { min = i; for (j = i+1; j < n; j++) { if(Tile.get(j).compareTo(Tile.get(min)) < 0) min = j; } //Swap. Tile t = Tile.get(min); Tile t1 = Tile.get(i); Tile.set(min, t1); Tile.set(i, t); } } } class Main { public static void main(String[] args) { Rack craigTiles = new Rack(); craigTiles.addTile(new Tile('H', 4)); craigTiles.addTile(new Tile('E', 1)); craigTiles.addTile(new Tile('L', 1)); craigTiles.addTile(new Tile('L', 1)); craigTiles.addTile(new Tile('O', 1)); craigTiles.addTile(new Tile('Z', 10)); craigTiles.addTile(new Tile('Y', 4)); craigTiles.sortHighToLow(); System.out.println("Craig's rack of tiles, in order from most valuable to least:"); System.out.println(craigTiles); Rack bettoTiles = new Rack(); bettoTiles.addTile(new Tile('E', 1)); bettoTiles.addTile(new Tile('A', 1)); bettoTiles.addTile(new Tile('S', 1)); bettoTiles.addTile(new Tile('D', 2)); bettoTiles.addTile(new Tile('W', 4)); bettoTiles.addTile(new Tile('T', 1)); bettoTiles.addTile(new Tile('N', 1)); bettoTiles.sortHighToLow(); System.out.println("Betto's rack of tiles, in order from most valuable to least:"); System.out.println(bettoTiles); } }

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

See similar textbooks

Related questions

Concept explainers

Question

How do I sort tiles from least valuable to most valuable?

import java.util.ArrayList;

class Rack
{
private ArrayList<Tile> Tile;

public Rack()
{
Tile = new ArrayList<Tile>();
}

public void addTile(Tile t)
{
Tile.add(t);
}

public String toString()
{
String str = "";
for(int i=0; i < Tile.size() ; i++)
str = str + Tile.get(i);

return str;
}

public void sortHighToLow()
{
int i, j, min;
int n = Tile.size();

for (i = 0; i < n-1; i++)
{
min = i;
for (j = i+1; j < n; j++)
{
if(Tile.get(j).compareTo(Tile.get(min)) < 0)
min = j;
}

//Swap.
Tile t = Tile.get(min);
Tile t1 = Tile.get(i);

Tile.set(min, t1);
Tile.set(i, t);

}
}
}

class Main
{
public static void main(String[] args)
{
Rack craigTiles = new Rack();
craigTiles.addTile(new Tile('H', 4));
craigTiles.addTile(new Tile('E', 1));
craigTiles.addTile(new Tile('L', 1));
craigTiles.addTile(new Tile('L', 1));
craigTiles.addTile(new Tile('O', 1));
craigTiles.addTile(new Tile('Z', 10));
craigTiles.addTile(new Tile('Y', 4));
craigTiles.sortHighToLow();
System.out.println("Craig's rack of tiles, in order from most valuable to least:");
System.out.println(craigTiles);

Rack bettoTiles = new Rack();
bettoTiles.addTile(new Tile('E', 1));
bettoTiles.addTile(new Tile('A', 1));
bettoTiles.addTile(new Tile('S', 1));
bettoTiles.addTile(new Tile('D', 2));
bettoTiles.addTile(new Tile('W', 4));
bettoTiles.addTile(new Tile('T', 1));
bettoTiles.addTile(new Tile('N', 1));
bettoTiles.sortHighToLow();
System.out.println("Betto's rack of tiles, in order from most valuable to least:");
System.out.println(bettoTiles);
}
}

Expert Solution

Step by step

Solved in 4 steps with 2 images

SEE SOLUTION Check out a sample Q&A here

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.

Similar questions