Blog

A stack is the best data structure for implementing a breadth-first search.

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

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

Which of the following functions does NOT allow an Date r-value to be passed as a parameter (assume Date is a class)?

This vector represents a min-heap:    10, 20, 13, 24, 27, 22, 35, 50, 25 What is the state of the vector after the operation Insert(15) is run on this heap?

Suppose that we are using a quick sort algorithm to sort the following vector 53, 3, 37, 78, 27, 19, 47, 81, 40, 77, 93, 29, 52, 15, 65 Suppose that the pivot element chosen is 52.  Which of the following would be a valid state of the vector after the first partitioning step (but before the recursive calls on the partitions)?

In the complexity analysis of an algorithm’s run time T(n), which of the following represents a lower 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? Inserting an element into the first slot of a vector.

An algorithm takes 0.5 ms (milliseconds) for input size 1024.  Approximately how long (in milliseconds) will it take for input size 32,768 if the running time analysis for the algorithm is

Merge sort cannot be sorted in place — it needs an extra container to store results.