read 2 numbers each and compare them

[cable]

lets say you keep reading two int numbers every round
you save the first int numbers which they are not same and the last two numbers which they are not
so if you read this
2, 3
4,5
5,6
7,7
you print 2,3 and 5,6 which one is the best algorithm to code if you are not able to use linked lists

[laserlight]

That's easy: record the first pair of numbers that is not the same. Record the most recent pair of numbers that is not the same. When you have finished processing all the pairs, the most recent pair of numbers that is not the same will also be the last pair that is not the same.

[cable]

thanks for the reply
i have written the function which always saves the current numbers which are not the same but i cannot find how can i save the first numbers which are not the same as the function i have written always saves the current different numbers

[laserlight]

Set a flag variable when you first identify numbers that are not the same. By checking this flag, you thus avoid overwriting.

[iMalc]

If you save something when a condition is tue, then the value it holds at any given time will always be the last value where that condition was true.