For example:
The Numbers are 5 6 7 8 12 13 49 52
first find the smallest number (in this example:5) next, count about three times (in this example:8) and remove 8 from the arrangements and do this action while you arrive the last of arrangement and until just one number got not removed.
so, the next number after 8 will be (49) and after 49 we will arrive the last of arrangement so we must start the pathway we did before from beginning (the next number will be removed is (6) and the next one will be (13) the next will be (7) and the next one will be (5) and the next one will be 12
At last the number which has not been removed will be 52 .
Second Example:
The Arrangement of numbers are 25 34 85 79 52 13 48 77
As first example, the smallest number which is chosen is (13) next, count three times forward and remove this. so the number (25) will be removed and the next one is 79 which is removed the next one is 48 that will be removed the next one is 85 and the net one is 77 and the next one is 13 and the next one is 34
At last, the number which has not been removed is 52
Note:Blue numbers are smallest one in each arrangements
Red numbers are not been removed in each arrangements
Green numbers which have been removed in each arrangements

VulpesPosted Apr 15, 2014, 6:15 AM
However, I can't write the rest of it any simpler than it already is.
What you have to remember here is that, when you remove an element from the list, the indices of the subsequent elements all move down by one. So, after each removal, instead of moving 3 elements to the right you only move 2 and, if there are not enough elements left, you have to wrap around to the beginning of the list again.
Also, when you get down to the last 2 elements, you have to make sure that the new index isn't outside the list altogether. Hence the need for the line:
if (index == li.Count) index = 0;
VulpesPosted Apr 18, 2014, 7:12 PM
It also works for some other sets I tried.
Have you found a set for which it doesn't work?
Joe WilsonPosted Apr 18, 2014, 2:31 PM
What is going there.
Joe WilsonPosted Apr 15, 2014, 10:14 AM
Best Wishes
Joe Wilson
Joe WilsonPosted Apr 15, 2014, 5:27 AM
But, in this example: i want to ask the user to enter the elements of arrangement
then use the method that i explained above by the way your answer is a bit complex so pleas rewrite it simply.
Best Wishes
Joe Wilson
Joe WilsonPosted Apr 15, 2014, 5:23 AM
But There are problems in the loops
so, Please check your answer again.
Best Wishes
Joe Wilson
VulpesPosted Apr 13, 2014, 4:22 PM
The output is:
52
52
akshat goelPosted Apr 13, 2014, 3:14 PM
In the above code I have taken a array of numbers...
making the selected number as null..
Just in the end need to find a way to count number of nulls and if no. of nulls = number of elements -1;
then show the non null element...