(a) HeapSort has worst-case time complexity of O(n log(n)). (4%)

6. Draw the contents of the hash table in the boxes below given the following conditions: The size of the hash table is 12. Open addressing and double hashing is used to resolve collisions. The hash function used is H(k) = k mod 12. The second hash function is: H2(k) = 7 – (k mod 7). What values will be in the hash table after the following sequence of insertions? Draw the values in the boxes below, and show your work for partial credit. 33, 10, 9, 13, 12, 45, 26, 17. (20%)

題組內容

(a) HeapSort has worst-case time complexity of O(n log(n)). (4%)

相關申論題

相關試卷