Jaegool_'s log

Priority Queues could be implemented as a list, but that has efficiency issues. At least one of insertion and deletion will be O(n). Binary heaps are an alternative that offers better performance Min Binary Heap: Min binary tree + a complete tree(insert from the left child) percolate up: when inserting a smaller value in a min binary heap Constant to insert the value at the end. Must swap with a..

Progress Check 11 on Hash Tables 1. Insertion and searching in a search tree dictionary has a best case of O(log(n)) and we sometimes aren't even that lucky. What is the best search time that we can reasonably achieve in a hash table? O(1), constant time search 2. Which of the following hash functions is correct for an integer key being stored in a dictionary of size tableSize? hash(key) = key %..

1. What are the height and depth of the J node in the tree above? height = 1, Depth: 2 2. Which of the following is NOT a leaf node? D 3. Which of the following terms best describes the relationship of G to M? Aunt HW 4. More Linked List Practice void doUnion(const list& list1, const list& list2, list& result) { list::const_iterator iter1; list::const_iterator iter2; // your code here -- make su..

Progress Check on Algorithm Analysis 1. Put these in order from lowest to highest. Lowest O(1) O(log n) O(n) O(n log n) O(n2) O(n3) Highest 2. The actual running time of a given function is determined by the expression 3n + 4 + 5n2. What is the Big-Oh notation that accurately describes the function? c. O(n^2) a. O(n) b. O(3n) c. O(n^2) d. O(5n^2) 3. You have analyzed a particular program to be O..