S.O.S. Mathematics CyberBoard

/ Student Unit Program Version
// This same file is used for 80, 90 and 100 point versions.
// Initially, the file is ready for the 80-point version. You must remove
// comments for the 90 and 100 point versions.


import java.io.*;
import java.util.Random;


public class Lab18bst
{
public static void main(String args[]) throws IOException
{
BufferedReader input = new BufferedReader(new InputStreamReader(System.in));
System.out.print("\nEnter list size ===>> ");
int listSize = Integer.parseInt(input.readLine());
List array = new List(listSize);

array.display();
array.pause();
// System.out.println("\nThe largest number in the list is " + array.getMax());
// System.out.println("\nThe smallest number in the list is " + array.getMin());
array.sortList();
array.display();
array.pause();

System.out.print("\nEnter search number 1 ===>> ");
int searchNumber1 = Integer.parseInt(input.readLine());
System.out.print("Enter search number 2 ===>> ");
int searchNumber2 = Integer.parseInt(input.readLine());
array.linearSearch(searchNumber1);
array.pause();
// array.binarySearch(searchNumber1);
// array.pause();
array.linearSearch(searchNumber2);
array.pause();
// array.binarySearch(searchNumber2);
// array.pause();
}
}


class List
{
private int intArray[]; // stores array elements
private int size; // number of elements in the array

public List(int s)
{
Random rand = new Random(12345);
}

public void display()
{
System.out.println("\nDISPLAYING ARRAY ELEMENTS");
for (int k = 0; k < size; k++)
System.out.print(intArray[k] + "\t");
}

public void pause() throws IOException
{
BufferedReader input = new BufferedReader(new InputStreamReader(System.in));
String dummy;
System.out.print("\nPress <Enter> to continue ===>> ");
dummy = input.readLine();
}

/* Required for 100 point version
public int getMax()
{

}

public int getMin()
{

}
*/

private void swap(int x, int y)
{
int temp = intArray[x];
intArray[x] = intArray[y];
intArray[y] = temp;
}


public void sortList()
{
System.out.println("\nPERFORMING SORTING ALGORITHM");
for (int p = 1; p < size; p++)
for (int q = 0; q < size-p; q++)
if (intArray[q] > intArray[q+1])
swap(q,q+1);


}

public void linearSearch(int sn)
{
System.out.println("\nPERFORMING LINEAR SEARCH");
boolean found = false;
for (int k = 0; k < size; k++)
if (intArray[k] == sn)
found = true;
return found;


}

/* Required for 90 and 100 point versions
public void binarySearch(int sn)
{
System.out.println("\nPERFORMING BINARY SEARCH");

}
*/

}

Put them in code tags. Anyway, I am NOT going to help you with the binarySearch method (as in, I will not write it) because the algorithm is very important and there's no reason why, after a little reading, you can't implement it yourself. It'll be in your text, and if for some strange reason it's not, http://www.google.com; It's very important and you need to know how to implement it.

This is what I would do...



-- X Conrad X