Design and Analysis Algorithm. Ahmad Afif Supianto, S.Si., M.Kom. Pertemuan 08

Transkripsi

1 Design and Analysis Algorithm Ahmad Afif Supianto, S.Si., M.Kom Pertemuan 0

2 Contents 4 Decrease and Conguer Insertion and Selection Sort DFS and BFS Binary Search Tree

3 Decrease and conquer. Mengurangi permasalahan menjadi lebih kecil pada permasalahan yang sama. Selesaikan permasalahan yang lebih kecil tersebut. Kembangkan permasalahan yang lebih kecil itu sehingga menyelesaikan permasalahan sebenarnya 4. Dapat dilakukan dengan dengan metode top down atau bottom up

4 Variasi decrease and conquer Decrease by a constant (Mengurangi secara konstan atau tetap) The size of a problem instance is reduced by the same constant factor (usually two) on each iteration of the algorithm (dikurangi secara faktar konstan yang sama) A size reduction pattern varies from one iteration to another (Ukuran pengurangan bervariasi dari satu iterasi ke iterasi lainnya). 4

5 Decrease by a constant (usually by ): insertion sort graph traversal algorithms (DFS and BFS) topological sorting algorithms for generating permutations, subsets Decrease by a constant factor (usually by half) binary search and bisection method exponentiation by squaring multiplication à la russe Variable-size decrease Euclid s algorithm selection by partition Nim-like games Biasanya menggunakan algoritma rekursif. 5

6 Permasalahan eksponensial: Hitung x n Brute Force: n- multiplications Divide and conquer: Decrease by one: Decrease by constant factor: T(n) = *T(n/) + = n- T(n) = T(n-) + = n- T(n) = T(n/a) + a- log a log n = (a-) n = when a = 6

7 Insertion sort To sort array A[0..n-], sort A[0..n-] recursively and then insert A[n-] in its proper place among the sorted A[0..n-] Usually implemented bottom up (nonrecursively) Example: Sort 6, 4,,,

8 Pseudo code Insertion sort

9 9

10 0

11 Kompleksitas waktu algoritma Insertion Sort: Penyelesaian: T(n) = cn + T(n ) = cn + { c (n ) + T(n ) } = cn + c(n ) + { c (n ) + T(n ) } = cn + c (n ) + c (n ) + {c(n ) + T(n 4) } =... = cn+c (n )+c(n )+c(n )+...+c+t() = c{ n + (n ) + (n ) + (n ) } + a = c{ (n )(n + )/ } + a = cn /+cn/ +(a c) = O(n )

12 Selection sort

13

14 Misalkan tabel A berisi elemen-elemen berikut: Langkah-langkah pengurutan dengan Selection Sort: 4

15 Kompleksitas waktu algoritma: Penyelesaian (seperti pada Insertion Sort): 5

16 Depth-First Search (DFS) Mengunjungi vertex-vertex pada grafik dengan selalu bergerak dari vertex yang terakhir dikunjungi ke vertex yang belum dikunjungi, lakukan backtrack apabila tidak ada vertex tetangga yang belum dikunjungi. Rekursif atau menggunakan stack Vertex di-push ke stack ketika dicapai untuk pertama kalinya Sebuah vertex di-pop off atau dilepas dari stack ketika vertex tersebut merupakan vertex akhir (ketika tidak ada vertex tetangga yang belum dikunjungi) Redraws atau gambar ulang grafik dalam bentuk seperti pohon (dengan edges pohon dan back edges untuk grafik tak berarah/undirected graph) 6

17 Pseudo code DFS 7

18 Example: DFS traversal of undirected graph a b c d e f g h DFS traversal stack: a ab abf abfe abf ab abg abgc abgcd abgcdh abgcd DFS tree: a b e f g 4 5 Red edges are tree edges and black edges are back edges. 6 c 7 d h

19 Notes on DFS Time complexity of DFS is O( V ). Why? each edge (u, v) is explored exactly once, All steps are constant time. 9

20 Breadth-first search (BFS) Mengunjungi vertex-vertex grafik dengan berpindah ke semua vertex tetangga dari vertex yang terakhir dikunjungi BFS menggunakan queue Mirip dengan level ke level dari pohon merentang Redraws atau gambar ulang grafik dalam bentuk seperti pohon (dengan edges pohon dan back edges untuk grafik tak berarah/undirected graph) 0

21 Example of BFS traversal of undirected graph a b c d e f g h BFS traversal queue: a bef efg fg g ch hd d a BFS tree: 6 b c d e f g h Red edges are tree edges and black edges are cross edges.

22 Pseudo code BFS

23 Notes on BFS Asumsi: setiap simpul dapat membangkitkan b buah simpul baru. Misalkan solusi ditemukan pada aras ke-d Jumlah maksimum seluruh simpul: +b+b +b +...+b d =(b d+ )/(b ) T(n) = O(b d ) Kompleksitas ruang algoritma BFS = sama dengan kompleksitas waktunya, karena semua simpul daun dari pohon harus disimpan di dalam memori selama proses pencarian.

24 Breadth First Search (grafik berarah) 4 s

25 Breadth First Search Shortest path from s 4 0 s Undiscovered Discovered Top of queue Finished Queue: s 5

26 Breadth First Search 4 0 s Undiscovered Discovered Top of queue Finished Queue: s 6

27 Breadth First Search 4 0 s Undiscovered Discovered Top of queue Finished Queue: s 7

28 Breadth First Search 4 0 s Undiscovered Discovered Top of queue Finished Queue: s 5

29 Breadth First Search 4 0 s Undiscovered Discovered Top of queue Finished Queue: 5 9

30 Breadth First Search 4 0 s 5 5 already discovered: 7 don't enqueue 6 9 Undiscovered Discovered Top of queue Finished Queue: 5 4 0

31 Breadth First Search 4 0 s Undiscovered Discovered Top of queue Finished Queue: 5 4

32 Breadth First Search 4 0 s Undiscovered Discovered Top of queue Finished Queue: 5 4

33 Breadth First Search 4 0 s Undiscovered Discovered Top of queue Finished Queue: 5 4

34 Breadth First Search 4 0 s Undiscovered Discovered Top of queue Finished Queue:

35 Breadth First Search 4 0 s Undiscovered Discovered Top of queue Finished Queue:

36 Breadth First Search 4 0 s Undiscovered Discovered Top of queue Finished Queue:

37 Breadth First Search 4 0 s Undiscovered Discovered Top of queue Finished Queue: 4 6 7

38 Breadth First Search 4 0 s Undiscovered Discovered Top of queue Finished Queue: 4 6

39 Breadth First Search 4 0 s Undiscovered Discovered Top of queue Finished Queue: 4 6 9

40 Breadth First Search 4 0 s Undiscovered Discovered Top of queue Finished Queue: 6 40

41 Breadth First Search 4 0 s Undiscovered Discovered Top of queue Finished Queue: 6 7 4

42 Breadth First Search 4 0 s Undiscovered Discovered Top of queue Finished Queue:

43 Breadth First Search 4 0 s Undiscovered Discovered Top of queue Finished Queue: 7 9 4

44 Breadth First Search 4 0 s Undiscovered Discovered Top of queue Finished Queue:

45 Breadth First Search 4 0 s Undiscovered Discovered Top of queue Finished Queue:

46 Breadth First Search 4 0 s Undiscovered Discovered Top of queue Finished Queue:

47 Breadth First Search 4 0 s Undiscovered Discovered Top of queue Finished Queue:

48 Breadth First Search 4 0 s Undiscovered Discovered Top of queue Finished Queue: 9 4

49 Breadth First Search 4 0 s Undiscovered Discovered Top of queue Finished Queue: 9 49

50 Breadth First Search 4 0 s Undiscovered Discovered Top of queue Finished Queue: 9 50

51 Breadth First Search 4 0 s Undiscovered Discovered Top of queue Finished Queue: 5

52 Breadth First Search 4 0 s Level Graph 5

53 Latihan: Gunakan algoritma BFS dan DFS untuk menemukan pohon merentang (spanning tree) dari graf G di bawah ini jika traversalnya dimulai dari simpul e. Dalam menjawab soal ini, perlihatkan traversal BFS/DFS sebagai pohon berakar dengan e sebagai akarnya. 5

54 Binary Search Tree Several algorithms on BST requires recursive processing of just one of its subtrees, e.g., Searching Insertion of a new key Finding the smallest (or the largest) key k <k >k 54

55 Binary Search Tree A binary search tree Not a binary search tree 55

56 56

57 Searching (Find) Find X: return a pointer to the node that has key X, or NULL if there is no such node BinaryNode * BinarySearchTree::Find(const float &x, BinaryNode *t) const { if (t == NULL) return NULL; else if (x < t->element) return Find(x, t->left); else if (t->element < x) return Find(x, t->right); else return t; // match } Time complexity: O(height of the tree) 57

58 Algorithm BST(x, v) //Searches for node with key equal to v in BST rooted at node x if x = NIL return - else if v = K(x) return x else if v < K(x) return BST(left(x), v) else return BST(right(x), v) Efficiency worst case: C(n) = n average case: C(n) ln n.9log n, if the BST was built from n random keys and v is chosen randomly. 5

59 Aplikasi DFS dan BFS Search Engine (google, yahoo, altavista).komponen search engine: Web Spider : program penjelajah web (web surfer) Index: basisdata yang menyimpan kata-kata penting pada setiap halaman web Query: pencarian berdasarkan string yang dimasukkan oleh pengguna (end- user) Secara periodik (setiap jam atau setiap hari), spider menjejalahi internet untuk mengunjungi halamanhalaman web, mengambil kata-kata penting di dalam web, dan menyimpannya di dalam index. Query dilakukan terhadap index, bukan terhadap website yang aktual. 59

60 60

61 6

62 Bagaimana spider menjelajahi (surfing) web? Halaman web dimodelkan sebagai graf berarah Simpul menyatakan halaman web (web page) Sisi menyatakan link ke halaman web Bagaimana teknik menjelajahi web? Secara DFS atau BFS Dimulai dari web page awal, lalu setiap link ditelusuri secara DFS sampai setiap web page tidak mengandung link. Pada setiap halaman web, informasi di dalamnya dianalisis dan disimpan di dalam basisdata index. 6

63 Click to edit subtitle style