Na date: 4/12/2018 USCL ce as item is added to the hash table indexstatuslist at position, say 1, we sert indexstatusList [il to b. 0 a. Quick C. 20. sort sorts the list by moving each element to itsproper place. c. Selection d. Insertion b. Bubble 21 If the list is stored in an array, we can traverse the list in either direction using an a. interface variable c. index variable d. iterator variable b. increment variable uicksort first selects an element in the list, called the and then partitions the list so that the one sublist are less than pivot. a. primate b. key c. pivot d. index 23. To divide the list into two sublists, we need to find the node of the li a. first b. middle In mergesort, most of the sorting work is done in a. c. last d. largest 24. dividing the lists sorting the sublists calculating the division points d. c. b. merging the sorted sublists 25. A is a list in which each element contains a key, such that the key in the element at positi is at least as large as the key in the element at position 2k + 1 (if it exists) and 2k+ 2 (if it exis a. hash table b. hemp c. heap d. pile In heapsort, after we convert the array into a heap, thephase begins. a. division b. merging 26. c. inserting d. sorting 7. In a heap, the is the largest element of the tree c. top node d. low node a. root node b. base node . In a heap, the element of the list is always the first element of the list. c. most important d. least important a. smallest b. largest To speed up item insertion and deletion in a data set, use a. arrays c. classes d. ADTs b. linked lists In C+t, a function name without any parentheses is considered a reference to the function address of the function pointer to an entry point pointer to the function c. a. d. b