https://github.com/n1ghtf1re/lab5
Lab №5. Analysis of array sorts
https://github.com/n1ghtf1re/lab5
Last synced: 6 months ago
JSON representation
Lab №5. Analysis of array sorts
- Host: GitHub
- URL: https://github.com/n1ghtf1re/lab5
- Owner: N1ghtF1re
- Created: 2017-11-03T18:03:53.000Z (almost 8 years ago)
- Default Branch: master
- Last Pushed: 2018-03-17T10:34:52.000Z (over 7 years ago)
- Last Synced: 2025-02-12T05:11:53.953Z (8 months ago)
- Language: Pascal
- Homepage:
- Size: 96.7 KB
- Stars: 2
- Watchers: 1
- Forks: 1
- Open Issues: 0
-
Metadata Files:
- Readme: README.md
Awesome Lists containing this project
README
Lab №5. Analysis of array sorts
--------------------
***
#### Task:
>The program analyzes the sorting data
**Language**: Delphi
**Code:**
``` pascal
program lab5;
{$APPTYPE CONSOLE}
const N=2000; MaxValue = 200; Shift = 100;
type TArray = array[1..N] of integer;
var BA,SA,QA, MainArr: TArray;
i,p,k: integer;
ShellComparisons, ShellPermutations: integer;
BubbleComparisons, BubblePermutations: integer;
QuickSortComp, QuickSortPerm: integer;
procedure Swap(var arr: TArray; var el1, el2: Integer);
var tmp:integer;
begin
tmp:=arr[el1];
arr[el1]:=arr[el2];
arr[el2]:=tmp;
end;
procedure writeTableHead;
begin
Writeln('+---------+-------------------------------+-------------------------------+-------------------------------+');
Writeln('| | Shell Sorting #1 | Adv. Bubble Sorting #2 | Quick Sort #2 |');
Writeln('| Array +---------------+---------------+---------------+---------------+---------------+---------------+');
Writeln('| type | Number of | Number of | Number of | Number of | Number of | Number of |');
Writeln('| | comparisons | exchanges | comparisons | exchanges | comparisons | exchanges |');
Writeln('+---------+---------------+---------------+---------------+---------------+---------------+---------------+');
end;
procedure QuickSort(const size: integer; var Comp,Perm: integer; var QA:TArray);
Procedure QuickSort(L,R: Integer);
var
I,J,X,Y:Integer;
begin
I:=L;
J:=R;
X:=QA[(L+R) div 2];
repeat
while QA[I]X do
begin
Dec (J);
Inc(Comp);
end;
if I<=J then
begin
SWAP(QA,i,j);
Inc(Perm);
Inc (I);
Dec (J);
end;
until I>J;
if J>L then
QuickSort(L,J);
if I=1) and (SA[m] > tmp)) do
begin
SA[M+k] := SA[m];
m:=m-k;
Inc(Comp);
Inc(Perm);
Inc(numb);
end;
SA[m+k] := tmp;
if(numb = 0) then
Inc(Perm);
Inc(Comp);
end;
end;
end;
procedure advBubble(const Size:integer; var Comp, Perm: Integer; var SA: TArray);
var i,k,z:integer;
F: Boolean;
begin
Comp:= 0;
Perm:= 0;
for i:=1 to size do
begin
if(BA[i] > BA[i+1]) then
begin
z:=i+1;
Swap(BA, i, z);
Inc(Perm);
k:=i;
f:=True;
while((k>1) and F) do
begin
if(BA[k-1] > BA[k]) then
begin
z:=k-1;
Swap(BA, z,k);
Inc(Perm);
Dec(k);
end
else
F:=False;
Inc(Comp);
end;
end;
Inc(Comp);
end;
end;
procedure CreateTableRow(const k:integer; rtype:string; var SC, SP, BC, BP, QC, QP: Integer);
begin
Writeln('|',k:4,' el. |', '':15,'|', '':15,'|', '':15,'|', '':15,'|', '':15,'|', '':15,'|');
Writeln('|',rtype:9,'|',SC:10,'':5, '|',SP:10,'':5, '|',BC:10,'':5, '|',BP:10,'':5, '|',QC:10,'':5, '|',QP:10,'':5, '|');
Writeln('+---------+---------------+---------------+---------------+---------------+---------------+---------------+');
end;
procedure reverse(var arr: TArray; const size: integer);
var i,tmp:Integer;
begin
for i:=1 to size div 2 do
begin
tmp:=Arr[i];
arr[i]:=Arr[k-i+1];
Arr[k-i+1]:=tmp;
end;
end;
begin
Randomize;
for i:=1 to N do
MainArr[i] := Random(MaxValue) - Shift;
writeTableHead;
for p:=1 to 3 do
begin
case p of
1 : k := 10;
2 : k := 100;
3 : k := 2000;
end;
SA:=MainArr;
BA:=MainArr;
QA:=MainArr;
// UNSORTED BEGIN
ShellSort(k,ShellComparisons,ShellPermutations, SA);
advBubble(k,BubbleComparisons,BubblePermutations, BA);
QuickSort(k, QuickSortComp, QuickSortPerm, QA);
CreateTableRow(k, 'unsorted' , ShellComparisons,ShellPermutations,BubbleComparisons,BubblePermutations, QuickSortComp, QuickSortPerm);
// UNSORTED END
// SORTED BEGIN
ShellSort(k,ShellComparisons,ShellPermutations, SA);
advBubble(k,BubbleComparisons,BubblePermutations, BA);
QuickSort(k, QuickSortComp, QuickSortPerm, QA);
CreateTableRow(k, 'sorted ' , ShellComparisons,ShellPermutations,BubbleComparisons,BubblePermutations, QuickSortComp, QuickSortPerm);
// SORTED END
// REVERS START
reverse(SA,k);
reverse(BA,k);
ShellSort(k,ShellComparisons,ShellPermutations, SA);
advBubble(k,BubbleComparisons,BubblePermutations, BA);
QuickSort(k, QuickSortComp, QuickSortPerm, QA);
CreateTableRow(k, 'rev. ord.' , ShellComparisons,ShellPermutations,BubbleComparisons,BubblePermutations, QuickSortComp, QuickSortPerm);
// REVERS END
end;
Readln;
end.
```