Contoh Pengerjaan Soal Sorting

Kamus:
constant Nmax : integer = 100
TabCount : array [ValMin..ValMax] of integer [0..Nmax]
N : integer

1. Contoh 1 (count sort)

Persoalan Count Sort:
T = [4, 5, 3, 1, 4]
N = 5

ValMin : 1
ValMax : 5

{Inisialisasi TabCount}
traversal i dari ValMin : 1 hingga ValMax : 5
i : 1, TabCounti <- 0
i : 2, TabCounti <- 0
i : 3, TabCounti <- 0
i : 4, TabCounti <- 0
i : 5, TabCounti <- 0

{Counting}
traversal i dari 1 hingga N : 5
i : 1
T1 : 4, TabCount4 <- TabCount4 {0} + 1
TabCount4 : 1
TabCount: [0, 0, 0, 1, 0]
i : 2
T2 : 5, TabCount5 <- TabCount5 {0} + 1
TabCount5 : 1
TabCount: [0, 0, 0, 1, 1]
i : 3
T3 : 3, TabCount3 <- TabCount3 {0} + 1
TabCount3 : 1
TabCount: [0, 0, 1, 1, 1]
i : 4
T4 : 1, TabCount1 <- TabCount1 {0} + 1
TabCount1 : 1
TabCount: [1, 0, 1, 1, 1]
i : 5
T5 : 4, TabCount4 <- TabCount4 {1} + 1
TabCount4 : 2
TabCount: [1, 0, 1, 2, 1]

{Pengisian Kembali T}
{Sebelum dilakukan pengisian, T: [4, 5, 3, 1, 4]
K <- 0
traversal i dari ValMin : 1 hingga ValMax : 5
i : 1
cek TabCount1 =/= 0, TabCount1: 1 =/= 0 {true}
repeat TabCount1 times {1 kali}
K <- K {0} + 1, K: 1, TK <- i
T: [1, 5, 3, 1, 4]
i : 2
cek TabCount2 =/= 0, TabCount2: 0 {false}
i : 3
cek TabCount3 =/= 0, TabCount3: 1 {true}
repeat TabCount3 times {1 kali}
K <- K {1} + 1, K: 2, TK <- i
T: [1, 3, 3, 1, 4]
i : 4
cek TabCount4 =/= 0, TabCount4: 2 {true}
repeat TabCount4 times {2 kali}
K <- K {2} + 1, K: 3, TK <- i
T: [1, 3, 4, 1, 4]
-------
K <- K {3} + 1, K: 4, TK <- i
T: [1, 3, 4, 4, 4]
i : 5
cek TabCount5 =/= 0, TabCount5: 1 {true}
repeat TabCount3 times {1 kali}
K <- K {4} + 1, K: 5, Tk <- i
T: [1, 3, 4, 4, 5]

Sorted Array T: [1, 3, 4, 4, 5]

2. Contoh 2 (Selection Sort)

*Note
Bebas menggunakan metode tracing contoh
1 atau contoh 2 untuk semua algoritma
sorting. Sesuaikan dengan algoritma yang
benar!