Escolar Documentos
Profissional Documentos
Cultura Documentos
Modul-1 : Pendahuluan
Rencana Penyajian
1. Pendahuluan
2. Fondasi Matematis
3. Analisa Complexity
4. Greedy Algorithm
5. Divide and Conquer
6. Dynamic Programming
7. Teknik Sort
8. Mid
9. Pattern Matching-1
10.Pattern Matching-2
11.Balanced Search Tree
12.Graph Traversal DFS/BFS
13.ShortestPathGraph Dijkstra&Floyd
14.Graph MST Prims & Kruskal
15.Algoritma Teori Bilangan
16.Final
O(n) n1 10 n1
O(n log n) n2 10 n2
bila n2 besar
O(n2) n3 3.16 n3
O(n3) n4 2.15 n4
O(2n) n5 n5 + 3.3
Deklarasi
integer idx1, idx2, temp;
Deskripsi
for ( idx1 = 1 to N-1 step 1 )
for ( idx2 = idx1 + 1 to N step 1 )
{ bila A[idx1] > A[idx2] tukar }
if ( A[idx1] > A[idx2] )
then temp A[idx1];
A[idx1] A[idx2];
A[idx2] temp;
endif.
endfor.
endfor.