![](../../images/PreviousTopic.jpg)
![](../../images/Index.jpg)
TOPIC N: Search & Sort
Contents :
Search: binary search
Sort:
QuickSort.
Exercises :
D1: Array Sorting.
-
Sort an array of 20 integers with the quickest algorithm.
-
Which parts of the sort algorithm should you adapt to sort a different
datastructure?
![](../../images/Top.jpg)
![](../../images/Index.jpg)
![](../../images/Syntax.jpg)
![](../../images/Errors.jpg)
![](../../images/Standards.jpg)
![](../../images/Skeleton.jpg)
S1: Klantendatabase (vervolg)
![](../../images/Top.jpg)
![](../../images/Index.jpg)
![](../../images/Syntax.jpg)
![](../../images/Errors.jpg)
![](../../images/Standards.jpg)
S2:
![](../../images/Top.jpg)
![](../../images/Index.jpg)
![](../../images/Syntax.jpg)
![](../../images/Errors.jpg)
![](../../images/Standards.jpg)
S3:
![](../../images/Top.jpg)
![](../../images/Index.jpg)
![](../../images/Syntax.jpg)
![](../../images/Errors.jpg)
![](../../images/Standards.jpg)
X1:
-
![](../../images/Top.jpg)
![](../../images/Index.jpg)
![](../../images/Syntax.jpg)
![](../../images/Errors.jpg)
![](../../images/Standards.jpg)
H1:
![](../../images/Top.jpg)
![](../../images/Index.jpg)
![](../../images/Syntax.jpg)
![](../../images/Errors.jpg)
![](../../images/Standards.jpg)
H2:
-
![](../../images/Top.jpg)
![](../../images/Index.jpg)
![](../../images/Syntax.jpg)
![](../../images/Errors.jpg)
![](../../images/Standards.jpg)
T1: Output
-
What is the output of the following program?
MODULE Test1;
FROM IO IMPORT WrLn, WrCard, RdCard;
BEGIN
END Test1.
![](../../images/Top.jpg)
![](../../images/Index.jpg)
![](../../images/Syntax.jpg)
![](../../images/Errors.jpg)
![](../../images/Standards.jpg)
![](../../images/PreviousTopic.jpg)
![](../../images/Top.jpg)
![](../../images/Index.jpg)