Question

When 1) Using a set of values from 0 to 10, perform the following unions using union-by-size. Show the result of each union. sizes are the same, make the second tree be a child of the first tree. union(find(), find(1)) // union the two roots, one from find(e) and one from find(1) union(find(2), find (3) union(find(4), find(5)) union(find(4), find (6) union(find(7), find (8) union(find(7), find (9)) union(find(7), find (10) union(find(1), find(5)) union(find(3), find (9)) union(find(1), find (3) 10 points 2) Illustrate the array for the final forest of the previous problem (note that roots are not simply -1 when using union-by- size).

Answer 1

Please give thumbs up if you like it

Let us first discuss the concept of Find and union then we will proceed to the question

Step 1

ser operations find algo Disjoint seu 2. Union (wed in Kuuskord MST implementation) bj = {115 52 = $2,618 {3,419.10] S3 = TO 2 -5 Pli 234 -4 i 4 2 2 2 4141 6 8919 2 5 Weighted union -9 -as-y Union (112) ping (5) - = 2

Algo wunion (ij) Time comp : 0 (1) Z = P[i] + [1] BC Prij<PcJD) || ser i has mose element P[j] = i; P[i] = Z =Z; an else P[i] =j; P[j] = z; 3 find Algo find (2) retuen Moot set of of which element i us witmony member! 45 kind (10) 4 = Hind (4) height: Algo find (2) { While (PC]>0) {i=pril Mehurn (i) To of find operation : 0 (height of settore) : 0(1095) }

ete Page No.: =) Sutiany n sets each ser one element. 2 3 Switid, P[i] - 2 3 4 Sete m-l az it by using n sets combine into Isel (o union opevations: b] min weight of set tyce ? Union (211) b) ou Union 2,3) Union 1214 height: we Union) (210 Pli 2 2 2 2 -- 2. 3 4 Max height of set tree? Union (112) Union (314) Union (0-1,2 2 n- { @ er24

n sets each set 2 element 2 Height union (113) Union (517) Union (n-310-1) 2-3 nsels 22 (2²element #foo n-2 each 4 Height: 2 2K ex. sets each sets ak elements Height : K Height : Ollogn). 8
Step 2

O Unionc find co), findcil bo'?) in © Union (find (2), find (3) (3 Union (find cu), find (s) ) 4 (4 union (find (4), find (6)) a troit all la 5 Unionc find (7), find (8) ) 66 Union (find (7), find ca))

• Union Cfind (7), find Cio)) ४ (10) ® Union find ui), find (5)) 9 Unionc find C3), findca))

10 Union (find ci), find (3)) 10) (이 GER Findl Array of final Result 의 인구 비니 비글 7 I L'34 S 6 910 Let us find bath for 3 3컷7 Similiarly for baths s깨7 In array index 5 is 4 and 4th index is 7