(b) What is the sixth vertex that Prim's algorithm includes if starting from vertex A (the numbering of the inclusion order starts from 1, not 0)?__ (15)__ (A)C(B)E (C)H (D)I

I .When CAN the worst case of Quicksort occur? __(1)__ C1:Quick Sort where leftmost (or rigltmost) element is always chosen as pivot C2: leftmost element is chosen as pivot and array is already sorted in SAME order C3: leftmost element is chosen as pivot and array is already sorted in REVERSE order (A)C1 (B)C2 (C) C1 and C2 (D) C2 and C3

(b) What is the sixth vertex that Prim's algorithm includes if starting from vertex A (the numbering of the inclusion order starts from 1, not 0)? (15)
(A)C
(B)E
(C)H
(D)I

相關試題

相關試卷