Re: program of sets
On Oct 11, 9:07 am, sdl...@gmail.com wrote:
On Oct 11, 9:02 am, sdl...@gmail.com wrote:
On Oct 11, 8:47 am, Patricia Shanahan <p...@acm.org> wrote:
However, it is difficult to know what help you do want. You talk about
"get more ideas" but the key idea for a very simple set implementation,
using an array of boolean, was given to you in the problem statement.
After that, it is just a matter of writing code.
Perhaps you could show us some of the code you have written, or
attempted to write? That might let us know how to help you.
Patricia
sorry this is the corret one:
public class IntegerSet
{
private static final int SIZE = 101;
private boolean[] arraySet = new boolean[SIZE];
public IntegerSet() {} // No-arguments.
public IntegerSet(int... ints)
{
for(int i : ints)
arraySet[i] = true;
}
public IntegerSet union(IntegerSet other)
{
IntegerSet res = new IntegerSet();
for(int i=0; i<SIZE; i++)
{
res.arraySet[i]=this.arraySet[i] ||
other.arraySet[i];
System.out.printf("%5d%8d\n", i, arraySet[i]);
return res;
}
}
}
here is my main:
import java.util.Scanner;
public class UniversalSet
{
public static void main(String[] args)
{
Scanner input = new Scanner (System.in);
System.out.println("Welcome to the Universal Set\n");
System.out.print("This program is going to find the union or
intersection of any two sets you enter"
+ "\nPlease enter the first set: ");
int set1 = input.nextInt();
System.out.print("Please enter the second set: ");
int set2 = input.nextInt();
IntegerSet elementSet;
elementSet = new IntegerSet(set1, set2);
}
}