Decisions 2.0 / 5 based on 1 rating ? Further MathsASEdexcel Created by: hollieCreated on: 05-03-13 21:26 What's an Algorithm? set of precise instructions which if followed will solve a problem 1 of 17 What do you write at the end of the Bubble sort Algorithm? no swaps so sorted 2 of 17 What side do you put smaller numbers of the midpoint in Quick Sort? left 3 of 17 How do you find the mid point for quick sort? half(n+1) 4 of 17 what does the square show in Quick Sort? end position 5 of 17 What order do you use the numbers in first fit? order they're already in 6 of 17 What order do you list binary search in? ascending or alphabetical 7 of 17 How do you find the mid point in binary search? half(n1+n2) 8 of 17 What do we call lines? edges 9 of 17 Whats a Hamiltonian Cycle? cycle that passes through every vertex once and ends at the start vertex 10 of 17 Whats a Eulerian Cycle? a cycle that includes every edge once 11 of 17 Whats a vertex set? list of all the vetices in the graph 12 of 17 Whats a simple graph? graph with no loops and not more than one edge 13 of 17 Whats a tree? where all the vertices are connected but there are no cycles 14 of 17 Whats Kruskals Algorithm? choosing the smallest edges in ascending order with no cycles 15 of 17 Whats Prims Algorithm? choosing any starting vertex and then the lowest nearest number 16 of 17 Whats Planarity Algorithm? when there are lines outside the shape so they dont cross inside except at vertexes 17 of 17
Comments
No comments have yet been made