Question : How do I write an algorithm to search for 2 or more matching values?

Ok, I have an actual problem, this is NOT an academic question.

There are 7 students (A,B,C,D,E,F,G) who participate in a throwing contest. Each student gets 4 tries to throw a ball as far they can. The throws may range anywhere from 0 ft to 50 ft. (discrete integers only, no decimals).

How do I write an algorithm that scans through all 28 throw attempts and highlights if and when there are any TIES in distance thrown? As in, 2 or more students threw their balls the EXACT same distance. I want to highlight the students and the distance of the FARTHEST-THROWN TIE and the SHORTEST-THROWN TIE.

When I say "highlight" I mean output which students threw the tie and how far they threw the ball...

Let's say the data is stored in structs as seen below....we can iterate through vThrows[0] through vThrows[6]. Any code that I can use would be much appreciated because I don't know where to start on this. Thanks!

1:
2:
3:
4:
5:
6:
7:
8:
9:



struct StudentAttempts
{
     int ThrowOne;
     int ThrowTwo;
     int ThrowThree;
     int ThrowFour;
}

vector <StudentAttempts> vThrows;

Answer : How do I write an algorithm to search for 2 or more matching values?

Use this instead

1:
2:
3:
4:



   Dim rs As Recordset
   Set rs = frm.Recordset
   rs.Delete
   rs.Requery

Question : How do I write an algorithm to search for 2 or more matching values?

Answer : How do I write an algorithm to search for 2 or more matching values?

Use this instead 1: 2: 3: 4: Dim rs As Recordset Set rs = frm.Recordset rs.Delete rs.Requery

Use this instead

1: 2: 3: 4:

Dim rs As Recordset Set rs = frm.Recordset rs.Delete rs.Requery