算法考试题..docVIP

Use Insertion Sort Algorithm to sort {49，38，65，97，76，13，27，49}. Show the sorting process.Void StrightInsertSort(int a[]) { int i,j; for(i=2;i=length;i++) { a[0]=a[i]//a[0]用来保存待插入元素 j=i-1; while(a[0]a[j]) { a[j+1]=a[j]; j--; } a[j+1]=a[0]; } } We observed that a worst case for Insertion Sort occurs when the keys are initially in decreasing order. Describe at least two other initial arrangements of the keys that are also worst cases. （我们观察到,一个坏的情况下,为插入排序时发生的键是首先在降序 Use Quicksort Algorithm to sort {49，38，65，97，76，13，27，49}. Show the dividing process of the first pass.. 27 38 13 49 76 97 65 49 How many key comparisons does Quicksort (choosing the first element as pivot) do if the array is already sorted? How many element movements does it do? （如果数组已经被排序，那么用快速排序算法要排多少次？（以第一个元素为中心），要移到多少元素？） n(n-1)/2 0 Carry out DFS Trace on the digraph, and classify all the edges(tree, back, cross, forward). Assume the vertices are indexed in alphabetical order in the adjVertices array and that each adjacency list is in alphabetical order. （DFS追踪执行有向图,并分类所有的边缘。承担顶点索引按字母顺序排列的adjVertices数组,每个邻接列表是按字母顺序排列的。） A-B-G-F-E-I (A,B) (A,B,G) (A,F) (A,F,E) (A,F,I) C-D-H (C,D) (C,H) 6、For the following graph, indicate which edges would be in the minimum spanning tree constructed by Prims MST algorithm, and which would in the tree constructed by Dijkstras shortest-path algorithm using v1 as the source. （以下图,指出边缘可能会在最小生成树算法,构造了一本正经的MST且这种在树上所构成的最短路径算法中使用v1作为来源） PRIM: 1 1 V1 V2 V3 V4 3 1 V5 V6 3 Dijkstra: (V1，V2) 1 (V1,V2,V3) 2 (V1,V2,V3,V5) 5 (V1,V2,V3,V5,V6) 8 (V1,V2,V3,V5,V6,V4) 9 7、1. Suppose the dimensions of the matrices A, B, C, and D are 30╳1, 1╳40, 40╳10, and 10╳25, respectively, and we want to know how best to compute A╳B╳C╳D. Show the computation process,