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

#include <stdio.h>
int main(void)
{
    float a[10],b[10],c[10],d[30];
 
    int na,nb,nc,nd,k;
 
    printf("Na: ");
    scanf("%i",&na);
 
    for (k=0; k<na; ++k){
        printf("a[%i] : ",k+1);
        scanf("%f",&a[k]);
    }
 
    printf("Nb: ");
    scanf("%i",&nb);
 
    for (k=0; k<nb; ++k){
        printf("b[%i] : ",k+1);
        scanf("%f",&b[k]);
    }
 
    printf("Nc: ");
    scanf("%i",&nc);
 
    for (k=0; k<nc; ++k){
        printf("c[%i] : ",k+1);
        scanf("%f",&c[k]);
    }
    nd=na+nb+nc;
 
    int ka=0,kb=0,kc=0;
 
    for (k=0; k<nd; ++k){
        if ((ka<na) &&((kb>=nb)||(a[ka]>=b[kb]))&&((kc>=nc)||(a[ka]>c[kc]))){
                d[k]=a[ka];
                ++ka;
        }else if ((kb<nb) && ((kc>=nc)||(b[kb]>c[kc]))){
                d[k]=b[kb];
                ++kb;
        } else {
                d[k]=c[kc];
                ++kc;
        }
    }
    printf("D: \n");
    for (k=0; k<nd; ++k) printf("  %i: %f\n",k+1,d[k]);
 
    return 0;
}

import random

def Merge(a,b,N_a,N_b):
    L = []
    i = 0
    a_idx = 0
    b_idx = 0
    while i < (N_a+N_b) and a_idx < N_a and b_idx < N_b :
    ##    print("i:",i,"; a_idx:",a_idx,"; b_idx:",b_idx)
        if a[a_idx] == b[b_idx] :
            L.append(a[a_idx])
            L.append(b[b_idx])
            a_idx += 1
            b_idx += 1
            i += 2
        elif a[a_idx] > b[b_idx] :
            L.append(a[a_idx])
            a_idx += 1
            i += 1
        else :
            L.append(b[b_idx])
            b_idx += 1
            i += 1
    if a_idx == N_a :
        while b_idx < N_b :
            L.append(b[b_idx])
            b_idx += 1
    if b_idx == N_b :
        while a_idx < N_a :
            L.append(a[a_idx])
            a_idx += 1

    return L
        

N = random.randrange(2,6)
a = sorted([random.randrange(0,10) for i in range(N)],reverse = True)
b = sorted([random.randrange(0,10) for i in range(N)],reverse = True)

 

c = sorted([random.randrange(0,10) for i in range(N)],reverse = True)

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

d = sorted(a+b+c,reverse = True)

print("Length of d:\n",len(d))
print("Array c:\n",d)

d2 = Merge(a,b,N,N)
d2 = Merge(d2,c,N*2,N)

print("Length of d2:\n",len(d2))
print("Array d2:\n",d2)
									

program Array64;
 
type
 MyArray = array[1..30] of integer;
 
var
  a,b,c,d,ab: MyArray;
  NA,NB,NC,k:Integer;
 
Function ConnectionArray(a,b:MyArray;NA,NB:Integer):MyArray;
  var
   tempArray: MyArray;
   i,ia,ib:integer;
  begin
   ia:=1;
   ib:=1;
   for i:=1 to NA+NB do
    begin
     if ia>NA then
      begin
       tempArray[i]:=b[ib];
       inc(ib);
      end
     else
     if ib>NB then
      begin
       tempArray[i]:=a[ia];
       inc(ia);
      end
     else
     if a[ia]>b[ib] then
      begin
       tempArray[i]:=a[ia];
       inc(ia);
      end
     else
      begin
       tempArray[i]:=b[ib];
       inc(ib);
      end;
 
    end;
    ConnectionArray:=tempArray;
  end;
 
begin
  Write('NA: ');
  Readln(NA);
 
  Writeln('A: ');
  for k:=1 to NA do
   begin
    write(k,' :');
    readln(a[k]);
   end;
  Write('NB: ');
  Readln(NB);
 
  Writeln('B: ');
  for k:=1 to NB do
   begin
    write(k,' :');
    readln(b[k]);
   end;
 
  Write('NC: ');
  Readln(NC);
 
  Writeln('C: ');
  for k:=1 to NC do
   begin
    write(k,' :');
    readln(c[k]);
   end;
//------------------------------
  ab:=ConnectionArray(a,b,NA,NB);
  d:=ConnectionArray(ab,c,NA+NB,NC);
 
  Writeln('D(',NA+NB+NC,'):');
  for k:=1 to NA+NB+NC do writeln(k,' :',d[k]);
end.