vector list search

[hezfast2]

Hello, I've written a multiple choice question version of a Hangman game. Everything works 'except' I don't want questions asked more than once. I've come up with a search algorithm, but I obviously don't have it correct, or I'm going wrong somewhere, It compiles but the questions still repeat. here's what I have so far: Any help or advice would be greatly appreciated.

Code:

		questionNum = (int)(Math.random() * 10);  
		while (isUsed)
		{
		searchResult = seqSearch(usedList, questionNum);
		if (searchResult == -1)
		{
		    isUsed = false;
      }//end if
		else
		    questionNum = (int)(Math.random() * 10);
		usedList.addElement(questionNum);
		}//end while
		QuestionInfo curQues = new QuestionInfo(questionObj[questionNum]);
		
		displayQuestion(questionObj, curQues, questionNum);

Code:

	public int seqSearch(Vector<Integer> usedList, int questionNum)
	{
		 boolean found = false;
		 
		 for (Integer num : usedList)
		     if (num == questionNum)
			  {
			      found = true;
					break;
			  }
		 if (found)
		     return 1;
			  else
			     return -1;
	}

[Fubarable]

Personally, I'd not use a Vector, but instead would use a ArrayList of Question, and then call Collections.shuffle(...) on my ArrayList. Then with a shuffled list simply loop through the list asking questions.

[Fubarable]

Cross-posted in the Sun Java forums. Please don't cross-post unless you are planning to upset folks in the various fora.