Suppose you have the array of numbers [3 2 5 4 1].
A. show the contents of the array after each swap step of a selection sort. Underline the most recently sorted element at each step, and use a vertical bar (|) to show the division between the sorted and the unsorted part of the array.
B. show the contents of the array after each swap step of an insertion sort. Underline the most recently sorted element at each step, and use a vertical bar (|) to show the division between the sorted and the unsorted part of the array.
C. Suppose you have an undirected graph with vertices V = {1, 2, 3, 4, 5, 6, 7}. Further suppose:
that vertices {1, 2, 3, 4} form a complete subgraph
that vertices {5, 6, 7} are a connected component
that vertices {5, 7} are not adjacent
that there is no path from vertex 1 to vertex 5
Draw the graph.
D. Suppose you treat the integers as a graph. In other words, there are an infinite number of vertices; 0 is adjacent to -1 and 1; 1 is adjacent to 0 and 2; and so on. This representation is similar to the "number line" that is sometimes used to teach basic arithmetic.
If you were to perform a breadth-first search, starting at 0 and with a goal of 3, in what order would the integers be visited? Assume that the neighbors of each integer are returned in their natural order (for example, the neighbors of 0 are -1 and 1, in that order).