华南理工大学《算法设计》实验报告.docxVIP

华南理工大学《算法设计》实验报告学 院：计算科学与工程专 业：计算机科学院与技术（全英创新班）姓 名:黄炜杰学 号：201230590051 【Experiment requirement】Use many sorting algorithm to sort the array that has n items. These items should be generated randomly. Use template to specify their types.Given a binary tree T which has n elements, and a number called a, search if a exists in T or not.Given a set of vertex and edges with weight in a directed graph G=(E,V), find the shortest path between two vertex in this graph.Given some things with weight and profit, to finish the program to solve it using Greedy method and Search tree method.Given a undirected Graph G=(V, E), to calculate the minimum spanning tree.Initial the 9 grids with number 1 2 3 4 5 6 7 8, they are located randomly at these grids. Rearrange them such that they distributed like this {1 2 3 ; 8 4 ; 7 6 5}. Use MFC or C# to implement it.【Experiment Implementation】5 sorting algorithms are used in my code:Quick Sort2. Selection Sort3. Bubble Sort4. Insertion Sort5. Shell SortAlso, every sorting function are declared as a template. So the input of these functions can be int, double or other comparable type.The size and elements are generated randomly. Result:All the sorting algorithm successfully sort the elements.Binary search tree is a tree structure that the element of parent node is always larger than its left children and smaller than its right children. To define such a structure, we first define a node structure:Every node has an element and two children. There are some functions to get or set their value. Then we define the binary search tree structure:The tree has a root and node count. Functions in this class include:Insert: insert an element to a proper position into the tree. When we insert an element, we will first point to the root. Then compare with it. If it’s larger than this node, pass it to the right children, otherwise to left children. Compare recursively until add it to the leaf.isLeaf: determine whether a given node is leaf node o