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?
S1: Klantendatabase (vervolg)
S2:
S3:
X1:
-
H1:
H2:
-
T1: Output
-
What is the output of the following program?
MODULE Test1;
FROM IO IMPORT WrLn, WrCard, RdCard;
BEGIN
END Test1.