//*---------------------------------//
// Course Number:
// Student Name:
// Program Number:
// Program Due Date:
// Purpose: Learning Inheritance, Superclass and Subclass.
//--------------------------------*//

import java.util.ArrayList; // directions for the program
import java.util.Collections;
import java.util.List;
import java.io.PrintWriter; // directions for the program
import java.util.Scanner; // directions for the program
import java.io.File; // directions for the program
import java.io.IOException; // directions for the program

public class NewMonster // creating the class
{
static Monster One = new Monster(null, 0, 0, 0); // creating a new Monster object
static ArrayList<Monster> monsterList;

public static ArrayList<Monster> bubbleSort(ArrayList<Monster> monsters, int choice) // function for bubble sort by any choice of monster field
{
for(int i=0; i < monsters.size()-1; i++) // repeat n-1 passes
{
for(int j=0; j < monsters.size()-i-1; j++) // repeat number of comparisons
{
if(choice==1 && monsters.get(j).getHealth() > monsters.get(j+1).getHealth()) // when choice of comparison is by health
{
Monster temp = monsters.get(j); // swapping process
monsters.set(j, monsters.get(j+1));
monsters.set(j+1, temp);
}

else if(choice==2 && monsters.get(j).getAttack() > monsters.get(j+1).getAttack()) // when choice of comparison is by attack
{
Monster temp = monsters.get(j); // swapping process
monsters.set(j, monsters.get(j+1));
monsters.set(j+1, temp);
}

else if(choice==3 && monsters.get(j).getExp() > monsters.get(j+1).getExp()) // when choice of comparison is by exp
{
Monster temp = monsters.get(j); // swapping process
monsters.set(j, monsters.get(j+1));
monsters.set(j+1, temp);
}
}
}
return monsters; // return the updated monster
}

public static ArrayList<Monster> selectionSort(ArrayList<Monster> monsters, int choice) // function for selection sort by any choice of monster field
{
for( int i=1; i < monsters.size(); i++) // repeat n passes
{
Monster smallM = monsters.get(i-1); // initial monster
int idx= i-1;
for(int j=i; j < monsters.size(); j++) // repeat inner loop for number of comparisons
{
if(choice==1 && monsters.get(j).getHealth() < smallM.getHealth()) // when choice of comparison is by health for small monster
{
smallM = monsters.get(j); // get smallest and get j-th
idx = j; // get its index
}

else if(choice==2 && monsters.get(j).getAttack() < smallM.getHealth()) // when choice of comparison is by attack for small monster
{
smallM = monsters.get(j); // get smallest and get j-th
idx = j; // get its index
}

else if(choice==3 && monsters.get(j).getExp() < smallM.getExp()) // when choice of comparison is by exp for small monster
{
smallM = monsters.get(j); // get smallest and get j-th
idx = j; // get its index
}
}

Monster temp = monsters.get(idx); // swapping process
monsters.set(idx, smallM);
smallM = temp;
}

return monsters; // return updated monsters
}

public static int binarySearch(ArrayList<Integer> monsters, int key) // setting up the binary search
{
int mid, low, high; // variable
low = 0; // setting variable
high = monsterList.size(); // setting variable
while (low <=high) // while loop
{
mid = low + (high-low)/2;
if(monsters.get(mid) == key) // main logic
{
return mid;
}
else if(monsters.get(mid) < key) // if not the above then this
{
low = mid + 1;
}
else // if not the above then this
{
high = mid - 1;
}

}
return -1; // returning value
}

public static void printMonsters(ArrayList<Monster> monsterList) // function prints the arraylist
{
for(int i=0; i < monsterList.size(); i++) // for loop
{
System.out.println("Monster Number " + (i + 1) + " - Name: " + monsterList.get(i).getName() + ", Health: " + monsterList.get(i).getHealth() + " , Attack: " + monsterList.get(i).getAttack() + ", EXP: " + monsterList.get(i).getExp()); // displaying the monster name, health, attack, and exp from the file
}
System.out.println();
}

public static void loadFile(String filename) throws IOException // creating a method for loading file
{
String data[];
monsterList = new ArrayList<Monster>();

Exercise 1 â€“ MergeSort Implement a MergeSort algorithm, which o...