4.2 Perbandingan Perhitungan Kompleksitas Waktu
4.2.1 Perhitungan Kompleksitas Waktu Metode Dempster Shafer
Perhitungan kompleksitas waktu dalam menentukan seeorang mengidap penyakit mental atau tidak dengan menggunakan metode dempster shafer dapat dilihat pada tabel 4.5.
Tabel 4.5 Perhitungan Kompleksitas Waktu dengan metode demspter shafer NO
Code C
C.
1 error_reporting0;
C
1
1 C
1
2 sqlDS = mysql_queryselect from symptom, jawaban where
jawaban.cache=._SESSION[pengguna]. and jawaban.date=.date. and symptom.psyco=pedofil and
symptom.id_symptom=jawaban.id_symptom; C
2
1 C
2
3 index = 1;
C
3
1 C
3
4 jlh_yes = 0;
C
4
1 C
4
5 while data = mysql_fetch_arraysqlDS {
C
5
n C
5
n 6
if data[jawab]==YES { C
6
n C
6
n 7
sqli = mysql_queryselect from symptom where id_symptom=.data[id_symptom].;
C
7
n C
7
n 8
dataDS = mysql_fetch_arraysqli; C
8
n C
8
n 9
m[index] = dataDS[belief]; C
9
n C
9
n 10 id[index] = dataDS[id_symptom];
C
10
n C
10
n 11 pl[index] = 1 - m[index];
C
11
n C
11
n 12 jlh_yes++;
C
12
n C
12
n 13 index++;
C
13
n C
13
n 14 if jlh_yes 6 {
C
6
n C
6
n 15 DSPedofil = 0;
C
14
1 C
14
16 else{ C
15
n C
15
n 17 n = 1;
C
16
1 C
16
18 while n = jlh_yes { C
5
n C
5
n 19 if n 2 {
C
6
n C
6
n 20 x = substrid[n], 0,1;
C
17
n C
17
n 21 y = substrid[n+1], 0,1;
C
18
n C
18
n 22 hk = 0;
C
19
n C
19
n 23 if x = y {
C
6
n C
6
n 24 hk[n] = m[n] + m[n+1];
C
20
n C
20
n 25 else{
C
15
n C
15
n 26 n = 1;
C
16
n C
16
n 27 whilei = 2{
C
5
n.n C
5
n
2
28 if i 2 { C
6
n.n C
6
n
2
29 M[i] = m[i] m[i+1]; C
21
n.n C
21
n
2
30 Ma[i] = pl[i] m[i]; C
22
n.n C
22
n
2
31 else{ C
15
n.n C
15
n
2
32 M[i] = m[i] m[i+1]; C
21
n.n C
21
n
2
Universitas Sumatera Utara
33 t[i] = pl[i-1] pl[i-1]; C
23
n.n C
23
n
2
34 P[n] += M[i]; C
24
n.n C
24
n
2
35 teta[n] += t[i]; C
25
n.n C
25
n
2
36 i++; C
26
n.n C
26
n
2
37 P[n] += Ma[n]; C
24
n C
24
n 38 elseifn 2{
C
25
n C
25
n 39 x = substrid[n], 0,1;
C
17
n C
17
n 40 y = substrid[n+1], 0,1;
C
18
n C
18
n 41 hk = 0;
C
19
n C
19
n 42 if x = y {
C
6
n C
6
n 43 hk[n] = m[n] + m[n+1];
C
20
n C
20
n 44 else{
C
15
n C
15
n 45 n = 1;
C
16
n C
16
n 46 whilei = 2{
C
5
n.n C
5
n
2
47 if i 2 { C
6
n.n C
6
n
2
48 M[i] = m[i] m[i+1]; C
21
n.n C
21
n
2
49 Ma[i] = pl[i] m[i]; C
22
n.n C
22
n
2
50 tmp1 = M[i] + Ma[i]; C
27
n.n C
27
n
2
51 M[i] = m[i] m[i+1]; C
21
n.n C
21
n
2
52 t[i] = pl[i-1] pl[i-1]; C
23
n.n C
23
n
2
53 P[n] += M[i]; C
24
n.n C
24
n
2
54 teta[n] += t[i]; C
25
n.n C
25
n
2
55 DS = P[n-1]; C
28
1 C
28
56 n++ C
29
1 C
29
Tn = C
1
+ C
2
+ C
3
+ C
4
+ C
14
+ C
16
+ C
28
+ C
29
+ 2C
5
+ 6C
6
+ C
7
+ C
8
+ C
9
+ C
10
+ C
11
+ C
12
+ C
13
+ 3C
15
+ + 2C
16
+ 2C
17
+ 2C
18
+ 2C
19
+ 2C
20
+ C
21
+ C
24
+ C
25
n + 2C
5
+ 2C
6
+ C
15
4C
21
+ 2C
22
+ 2C
23
+ 2C
24
+ 2C
25
+ C
26
+ C
27
nn = n
2
4.2.2 Perhitungan Kompleksitas Waktu Metode Certainty Factor
Perhitungan kompleksitas waktu dalam menentukan seseorang mengidap penyakit mental atau tidak dengan menggunakan metode certainty factor dapat dilihat pada tabel 4.6.
Tabel 4.6 Perhitungan Kompleksitas Waktu dengan metode Certainty Factor
NO Code
C C.
1 sqlCF = mysql_queryselect from symptom, jawaban where
jawaban.cache=._SESSION[pengguna]. and jawaban.date=.date. and symptom.psyco=pedofil and
symptom.id_symptom=jawaban.id_symptom; C
1
1 C
1
2 num = 0;
C
2
1 C
2
3 jumlah_yes_p = 0;
C
3
1 C
3
4 while data = mysql_fetch_arraysqlCF {
C
4
n C
4
n 5
if data[jawab]==YES { C
5
n C
5
n
Universitas Sumatera Utara
6 sqli = mysql_queryselect from symptom where
id_symptom=.data[id_symptom].; C
2
n C
2
n 7
dataCF = mysql_fetch_arraysqli; C
6
n C
6
n 8
mbCF[num] = dataCF[belief]; C
7
n C
7
n 9
mdCF[num] = 1 - mbCF[num]; C
7
n C
8
n 10 jumlah_yes_p++;
C
8
n C
9
n 11 num++;
C
9
n C
9
n 12 if jumlah_yes_p 6 {
C
5
n C
5
n 13 CFPedofil = 0
C
6
1 C
6
14 else{ C
10
n C
10
n 15 numb = 0;
C
11
1 C
11
16 while numb jumlah_yes_p { C
4
n C
4
17 if CFmb[0]==0 and CFmd[0]==0 { C
5
n C
5n
18 CFmb[numb] = mbCF[numb] + mbCF[numb+1] 1- mbCF[numb];
C
7
n C
7
n 19 else{
C
10
n C
10
n 20 CFmb[numb] = CFmb[numb-1] + mbCF[numb+1] 1-
CFmb[numb-1]; C
7
n C
7
21 numb++; C
12
n C
12
n 22 CFPedofil = CFmb[jumlah_yes_p-1];
C
6
1 C
6
Tn= C
1
+ C
2
+ C
3
+ C
2
+ 2C
4
+ 3C
5
+ 3C
6
+ 4C
7
+ C
8
+ C
9
+ 2C
10
+ C
11
+ C
12
n = n
4.3 Antarmuka Pengguna
Kategori