need help with Bitset

[vidu mayur]

This program sorts the numbers in a string array by using a bitset provided the numbers are unique. The program keeps track of which numbers have been seen by setting bits in a bitset.
The output is printed by visiting all the elements in the bit set. The output should be like this:
In sorted order: 2 9 10 21 43 45 52 66 68 71 87
This is the problem. I am not able to give the upper limit while accessing the elements in the bitset. I have given an arbitrary number 100 for now and the program is working. Is there any way to access the last element in the bitset.

import java.util.*;
public class SortIntegers{
  public static void main(String[] args) {
    BitSet sortSet = new BitSet();
    String args2[];
    args2 = new String[] {
        "9", "87", "43", "10", "2", "66", "52", "68", "45", "21", "71", "65"};
    int setBit,getBit, i, k = 0;
    while (true) {
      if (k == args2.length)
        break;
      for (i = 0; i < args2.length; i++) {
          setBit = Integer.parseInt(args2[i]);
          sortSet.set(setBit);
      }
      k++;
    }
    System.out.print("In sorted order: ");
    int j=0;
    for (j = 0; j < 100; j++){
      if (sortSet.get(j)){
         System.out.print(j + " ");
      }
    }
  }
}
  

Thanks in advance

[chi Lin]

try change
for (j = 0; j < 100; j++){ ... }
to
for (j = 0; j < sortSet.size(); j++){ ... }

[vidu mayur]

Hi
It works perfectly now.
Thanks