Решение задачи Array 75

#include <stdio.h>
int main(void)
{
    int a[11];
 
    int n;
 
    printf("N: ");
    scanf("%i",&n);
 
    int i;
    for (i=0; i<n; ++i){
        printf("a[%i] : ",i+1);
        scanf("%i",&a[i]);
    }
 
    int min=0,max=0;
 
    for (i=n-1; i>=0; --i){
        if (a[i]>a[max]) max=i;
        if (a[i]<a[min]) min=i;
    }
 
    if (max<min) {
        max+=min;
        min=max-min;
        max=max-min;
    }
 
    for (i=min; i<min+1+(max-min)/2; ++i){
            if (i!=(max-i+min)){
                a[i]+=a[max-i+min];
                a[max-i+min]=a[i]-a[max-i+min];
                a[i]=a[i]-a[max-i+min];
            }
        }
 
    printf("A: \n");
    for (i=0; i<n; ++i) printf("  %i: %i\n",i+1,a[i]);
 
    return 0;
}

import random

N = random.randrange(2,15)
a = random.sample(range(0, 100), N)
#a = [random.randrange(1,11) for i in range(N)]
#a = [i+1 for i in range(N)]

print("N:",N)
print("Array a:\n",a)

max_val = max(a)
max_idx = a.index(max_val)

min_val = min(a)
min_idx = a.index(min_val)

print("Max:",max_val,"; Index:",max_idx)
print("Min:",min_val,"; Index:",min_idx)

if min_idx < max_idx :
    start_idx = min_idx
    end_idx = max_idx
else :
    start_idx = max_idx
    end_idx = min_idx

L = end_idx + 1
K = start_idx + 1

##print("L:",L)
##print("K:",K)

M = (L-K+1)//2
##print("M:",M)
i = 0
while i < M :
##    print(i,K-1+i,L-1-i)
    a[K-1+i], a[L-1-i] = a[L-1-i], a[K-1+i]
    i += 1
   
print("Modified Array a:\n",a)
									

program Array75;
var
  a : array[1..10] of integer;
  N,Amin,Amax,i:Integer;
 
begin
  Write('N: ');
  Readln(N);
 
  Writeln('A: ');
  for i:=1 to N do
   begin
    write(i,' :');
    readln(a[i]);
   end;
 
 
  Amax:=1;
  for i:=1 to N do if a[Amax]<a[i] then Amax:=i;
  Amin:=Amax;
  for i:=1 to N do if a[Amin]>a[i] then Amin:=i;
 
  if Amin>Amax then
   begin
    Amin:=Amin+Amax;
    Amax:=Amin-Amax;
    Amin:=Amin-Amax;
   end;
 
   i:=Amin;
   while i<Amin+(Amax-Amin)/2 do
    if i<>(Amax-i+Amin) then
     begin
      a[i]:=a[i]+a[Amax-i+Amin];
      a[Amax-i+Amin]:=a[i]-a[Amax-i+Amin];
      a[i]:=a[i]-a[Amax-i+Amin];
      i:=i+1;
     end
    else i:=i+1;
 
 
  for i:=1 to N do writeln(i,' :',a[i]);
end.