Presentation is loading. Please wait.

Presentation is loading. Please wait.

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

Similar presentations


Presentation on theme: "Tujuan : Mahasiswa dapat Menunjukkan teknik sorting dalam pemograman terstruktur dengan menggunakan pseudocode."— Presentation transcript:

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

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

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

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

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

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

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

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

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

13  First step : Compare and swap adjacent entries in the entire array

14  Second step : Compare and swap adjacent entries (exclude the last entry)

15  Third step : Compare and swap adjacent entries (exclude the last two entries)

16  Fourth step : Compare and swap adjacent entries (exclude the last three entries)

17  Fifth step : Compare and swap adjacent entries (exclude the last four entries)

18  Sixth step : Compare and swap adjacent entries (exclude the last five entries)

19  Seventh step : Compare and swap adjacent entries (exclude the last six entries)

20  Eight step : Compare and swap adjacent entries (exclude the last seven entries)

21  Ninth step : Compare and swap adjacent entries (exclude the last eight entries)

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


Download ppt "Tujuan : Mahasiswa dapat Menunjukkan teknik sorting dalam pemograman terstruktur dengan menggunakan pseudocode."

Similar presentations


Ads by Google