2.2.2 Computational Methods

• Decomposition is the process of breaking down a large complex problem into smaller, more manageable problems.
• Divide and conquer is a computational method that breaks a problem into smaller subproblems and then solves each subproblem individually. Merge sort is an example of a divide and conquer algorithm
• Backtracking is a computational method used in certain recursive algorithms. e.g. in depth-first search, when the algorithm has gone as far as it can down a particular path, it then backtracks to previous nodes to see if there are any other paths that need to be explored.
• Data mining is the process of analysing data to discover patterns
• A heuristic is a rule of thumb that is used to make a decision. The A* pathfinding algorithm uses the heuristic of prioritising checking nodes which are closer to the destination node. This usually, but not always, results in A* finding the shortest path in fewer steps than Dijkstra's algorithm.
• Performance modelling is where computer simulations are run to try and get an idea of how a system will perform. This can be applied to many types of system or hardware, e.g. transport systems, power stations, aerodynamics, biology.