Design an algorithm for finding the maximum in a set and position?

Answer 1

First, let's assume that this is a set of integers that you want to find the maximum of:

Set setOfInts; // also assume that this set is full of some ints

Iterator it = setOfInts.iterator();

int max;

if(it.hasNext()) {

max = it.next();

while(it.hasNext()) {

int current = it.next();

if(current > max) {

max = current;

}

}

// max is now the largest number in the set

}

The problem comes when trying to find the position of the maximum number in the Set. By definition, a Set is an unordered group of numbers. So any order that the Set returns (say, by the Set's iterator) will be arbitrary.