What is the most appropriate complexity analysis (i.e. the closest fit) in terms of Big-O for the following operation? Quicksort on a sequence container

Suppose we are using a Quicksort algorithm that uses median-of-three partitioning.  For the following vector, what is the selected pivot value for the first round of partitioning? 45, 13, 68, 84, 22, 16, 55, 30, 40, 77, 91, 27, 5, 51, 63

Given vector V:  45, 13, 30, 84, 22, 16, 55, 68, 40, 77, 91, 27, 5 If we use Shellsort, what is the state of V after the first pass, if the first increment value is 5?

In a hash table, separate chaining is a collision strategy that finds another vector index for storing an element if there is already one at the original index.

To store a graph, an adjacency matrix is more efficient than an adjacency list.

What is the most appropriate complexity analysis (i.e. the closest fit) in terms of Big-O for the following operation? The delete function for a hash table

If the following is the data section of a linked list template class called MyList (where T is the type of the stored data), write the definition of the move constructor for this class, as it would appear in the corresponding mylist.hpp file for the class definitions (i.e. not inside the class declaration block): private: MyNode * front; // pointer to the first node in the list MyNode * back; // pointer to the last node in the list int count; // the number of elements stored in the list

In the complexity analysis of an algorithm’s run time T(n), which of the following represents an upper bound on the algorithm’s growth rate?

What is the most appropriate complexity analysis (i.e. the closest fit) in terms of Big-O for the following operation? Shell sort, using Shell’s original interval pattern (N/2, N/4, …., 1)

This vector represents a min-heap: 15, 25, 18, 29, 32, 27, 40, 55, 30 What is the state of the vector after the operation deleteMin() is run on this heap?