Help me Please from Turkey

[Bart]

STOP

We will NOT do your assignment for you (unless you pay obscene amounts of money).
The object of the assignment is that you should actually learn something from it.

I can give you code, but I promise you, your teacher will know that you did not ever write that yourself 

If you do not show us any of your efforts at all, I will ask the moderator of this forum to lock this topic.

Bart

[typo]

My solution (without sorting):

Code: [Select]

  LargeValue := Max(FirstValue, SecondValue);
  LargeValue := Max(LargeValue, ThirdValue);

  SmallValue := Min(FirstValue, SecondValue);
  SmallValue := Min(SmallValue, ThirdValue);

  for i := 0 to 2 do
    if (a[i] <> SmallValue) and (a[i] <> LargeValue) then
      IntermediateValue := a[i];


[stocki]

Stupid task! Please close!

[kmalpha]

The program was completed
Thanks to everyone

[typo]

The largest number can be found by starting with the larger digit, followed by the second larger one (intermediate), and terminating with the smallest one.

The smallest number can be found by starting with the smallest digit, followed by the second smaller one (the same intermediate), and terminating with the largest one.

So the intermadiate digit is always the same and you simply switch between the largest and  the smallest ones in order to find LargeNumber and SmallNumber.

[typo]

For example, if you have the digits 1,2,3,4,5,6,7,8,9, the largest number will be 987654321 and the smallest one will be 123456789.

No need to sort.

[rvk]

The largest number can be found by starting with the larger digit, followed by the second larger one (intermediate), and terminating with the smallest one.

No need to sort.

Hahaha  What do you call "first determining the largest number, then the second largest number etc. etc..." ???
I call that sorting

[CM630]

 Sorting 3 numbers is not a classical sort case, indeed.
Actually if all numbers are a single digit long (or even more than a digit), then one could loop down to find the biggest one, then loop up to find the smallest one. The one which is left is the middle value, since the total number of numbers is 3.

[typo]

Hahaha  What do you call "first determining the largest number, then the second largest number etc. etc..." ???
I call that sorting

No need to use standard computational sorting algorithms (QuickSort, BubbleSort, etc) or, worse, generate all possible numbers to sort.

For instance, for 3 digits (factorial 3, which is 6):

123
132
213
231
312
321

[wildfire]

typo,

I see both your and rvk's point.

rvk, typo used brute force, not an algorithm.

typo, technically you are sorting the figures in order.

Let's just call it a draw 

[Bart]

There is even no need to know the highest, middle, lowest digit at all.
You can bruteforce calculate all permutations of the three digits.
Save it if it is either higher than highest so far, or lower than lowest so far.
You end up with 2 3-digit numbers and subtract them. Answer found.

You could even write a lookuptable for any given three inputs.
It'll take some time to write that, but it may be weel worth the effort is this task has to be done trillions of time. Generally lookuptables are faster...

Still, no-one has seen any code from topic-starter, so it may very well be that him saying he finished the program is merely a tactic to see our solutions 

Bart

[skalogryz]

Still, no-one has seen any code from topic-starter, so it may very well be that him saying he finished the program is merely a tactic to see our solutions 

Obviously the code was private-messaged to kmalpha.
check out this thread

[typo]

I agree with Leledumbo that people just want to get their homework done and the compromise with the community is very small. So I agree with payment.