Getting Started with TRANSACT (32247-90007)
Chapter 6 109
Data Structures
Figure 6-21. Illustration of Dynamic Data Storage (Continued)
33 set(stack) list (start-of-parts);
34 let (count) = 0;
55 while (count) < (no-of-parts)
36 do
37 list part-number;
38 let (count) = (count) + 1;
39 doend;
40 let (count) = (no-of-parts);
41 while (count) > 0
42 do
43 display(table) part-number;
44 set(stack) list (*);
45 let (count) = (count) - 1;
46 doend;
47 end;
48
49 100-bubble-sort:
50
51 set(stack) list (start-of-parts);
52 let (count)= 1;
53 while (count) < (parts-this-pass)
54 do
55 let (count) = (count) + 1;
56 list from-part:
57 to-part;
58 if (from-part) < (to-part)
59 then
60 do
61 move (temp-part) = (to-part);
62 move (to-part) = (from-part);
63 move (from-part) = (temp-part);
64 doend;
65 set(stack) list (*);
66 doend;
67 let (parts-this-pass) = (parts-this-pass) - 1;
68 return;