Math Is Fun Forum

program Project1;

{$mode objfpc}{$H+}

uses
  {$IFDEF UNIX}{$IFDEF UseCThreads}
  cthreads,
  {$ENDIF}{$ENDIF}
  Classes
  { you can add units after this };

const
  k=100;

type
  niz=array[1..k] of real;
  matrica=array[1..k] of niz;

var
  a:matrica;
  n,i,j:integer;

procedure exchange(x,y:real);
var p:real;
begin
  p:=x;
  x:=y;
  y:=p;
end;

procedure QuickSort(var a:matrica;var b:niz;levi,desni,n:integer);
var
  i,j,k:integer;
  D:real;
begin
  if levi<desni then
  begin
    i:=levi;
    j:=desni;
    D:=b[desni];
    repeat
      while b[i]<D do
        i:=i+1;
      while (b[j]>=D) and (i<j) do
        j:=j-1;
      if i<j then
      begin
        exchange(b[i],b[j]);
        for k:=1 to n do
          exchange(a[i][k],a[j][k]);
      end;
    until i=j;
    exchange(b[i],b[desni]);
    QuickSort(a,b,levi,i-1,n);
    QuickSort(a,b,i+1,desni,n);
  end;
end;

procedure GrowingRows(var a:matrica;n:integer);
var
  b:niz;
  i:integer;
begin
  for i:=1 to n do
    ------------b[i]=a[i][1];------------
  QuickSort(a,b,1,n,n);
end;

begin
  write('Enter the number of rows of the square matrix: ');
  readln(n);
  for i:=1 to n do
    begin
      for j:=1 to n do
        read(a[i][j]);
      readln;
    end;
  GrowingRows(a,n);
  for i:=1 to n do
    for j:=1 to n do
      write(a[i][j]);
  readln;
end.