1. Tujuan : Mahasiswa dapat Menunjukkan teknik sorting dalam pemograman terstruktur dengan menggunakan pseudocode

2.  Sort  instructions arrange records in an order based on a field or fields within each record  Jenis Sort : > Ascending  from smallest to largest > Descending  from largest to smallest  Primary Key & Secondary Key

3.  Initialize the sort work area  Sort instruction require at least one temporary soft file  Be set up by the program  Automatically written to the output file specified

4.  First step : Swap / interchange first entry with higest entry 50825677329095886299 99825677329095886250

5.  Second Step : Swap second enry with highest value (exclude first entry) 99825677329095886250 99955677329082886250

6.  Third Step : Swap third entry with highest value (exclude first two entries) 99955677329082886250 99959077325682886250

7.  Fourth Step : Swap fourth entry with highest entry (exclude first three entries) 99959077325682886250 99959088325682776250

8.  Fifth Step : Swap fifth entry with highest value (exclude first four entries) 99959088325682776250 99959088825632776250

9.  Sixth Step : Swap sixth entry with highes value (exclude first five entries) 99959088825632776250 99959088827732566250

10.  Seventh Step : Swap seventh entry with highest value (exclude first six entries) 99959088827732566250 99959088827762563250

11.  Eight Step : Swap eight entry with highest value (exclude first seven entries) 99959088827762563250

12.  Ninth Step : Swap ninth entry with highest value (exclude first eight entries) 99959088827762563250 99959088827762565032

13.  First step : Compare and swap adjacent entries in the entire array 50825677329095886299 82567750909588629932 82 50 56 50 77 50 90 32 95 32 88 32 62 32 99 32 50 32

14.  Second step : Compare and swap adjacent entries (exclude the last entry) 82567750909588629932 82775690958862995032 82 56 77 56 50 95 50 88 50 62 50 99 50 90 50

15.  Third step : Compare and swap adjacent entries (exclude the last two entries) 82775690958862995032 82779095886299565032 82 77 56 90 56 88 56 62 56 99 56 95 56

16.  Fourth step : Compare and swap adjacent entries (exclude the last three entries) 82779095886299565032 82909588779962565032 82 77 90 77 95 77 62 99 62 88 77

17.  Fifth step : Compare and swap adjacent entries (exclude the last four entries) 82909588779962565032 90958882997762565032 90 82 95 82 88 82 99 77 82 77

18.  Sixth step : Compare and swap adjacent entries (exclude the last five entries) 90958882997762565032 95908899827762565032 95 90 88 82 99 82

19.  Seventh step : Compare and swap adjacent entries (exclude the last six entries) 95908899827762565032 95909988827762565032 95 90 88 99 88

20.  Eight step : Compare and swap adjacent entries (exclude the last seven entries) 95909988827762565032 95999088827762565032 95 90 99 90

21.  Ninth step : Compare and swap adjacent entries (exclude the last eight entries) 95999088827762565032 99959088827762565032 99 95

22.  Maksimal 5 Orang untuk 1 Kelompok  Buat Latihan Logic Exercise soal no.6 hal 241 dari buku “Programming Logic for Business – Laura Saret”  Buat Pseudocode dan flowchartnya  Kumpulkan minggu depan