Problem Solving

Algorithms
1. set of step-by-step instructions to solve a problem
2. For improved efficiency
3. Algorithms can be reused a number of times
Sequence, selection and iteration
1. Sequence
2. Selection (if statements)
3. Iteration (Loops)
Pseudo-Code
1. Way to show an algorithm in English
2. Uses keywords and commands without syntax rules of programming languages
3. Helps developers create a solution in a high level programming language
Flowcharts
1. Algorithms can be displayed as flow charts
2. Flow chart shapes
Debugging Algorithms
1. Dry Runs
  1. is a way of running through an algorithms one step at a time, looking for inputs, processing and outputs to identify any errors within the code
2. Trace tables
  1. This is a visual way of writing down each variable, input and output within the algorithm to show an errors
  2. https://www.bbc.co.uk/education/guides/z8n3d2p/revision/8
Searching algorithms
1. Searching needs to be efficient to find data.
  1. Linear Search
    1. https://www.youtube.com/watch?v=TwsgCHYmbbA
    2. http://www.teach-ict.com/2016/GCSE_Computing/AQA_8520/3_1_fundamentals_of_algorithms/searching/miniweb/pg3.php
    3. This is a sequential algorithm which start at the beginning of the list and moves through one item at a time until it finds a match or gets to the end of the list
    4. This is an example of brute force algorithm as it only uses row computing power to do the task
      1. This is not very efficient way of finding the answer
        For the list on the left with 7 items of data the best case would be the first item there is a match. However the worst case would be the last item in the list. The average would be 7 + 1 / 2 = 4 item in the list.
  2. Binary Searches
    1. https://www.youtube.com/watch?v=T98PIp4omUA
    2. https://www.bbc.co.uk/education/guides/zywmyrd/revision/5
    3. For a binary search the data mush be sorted first into ascending order. This search method uses a divide and conquer method to find items.
      1. 1. Select the median 2. Compare it with the search item 3. If it is lower than discard the median and the higher items or if it is higher than discard the median and the lower items. 4. Recalculate the new median 5. Repeat until the item has been found
  3. Comparing linear and binary searches
    1. Binary searches are more efficient than a linear search but the list has to be sorted first
Decomposition and Abstraction
1. Decomposition
  1. Breaking a problem doing into a list of sub problems, so that it is easier to solve a problem.
2. Abstraction
  1. Identify the essential elements that must be included within a program e.g. for a dice throw within a game you would need to generate a random number between 1 and 6.
3. Must also identify, input, outputs and processing needed within a solution
Sorting algorithms
1. Bubble sort
  1. https://www.youtube.com/watch?v=RT-hUXUWQ2I
  2. A bubble sort starts at the begging of the list and compares each value with the one next to it
  3. This process is repeats via a Pass until the list has been sorted into ascending or descending order
2. Merge sort
  1. https://www.youtube.com/watch?v=Pr2Jf83_kG0
  2. 1- break the list into 2, then repeat until you have a list of 1 item
  3. 2 - reassemble the list in the same way as you broke it apart, by comparing each value putting the flower value first
  4. 3 - compare the first vale of each list putting the smaller value first in the new joint list
  5. 4 - Combine the list in the same way to form a sorted list
3. https://www.bbc.co.uk/education/guides/z22wwmn/revision/3

Next up

Problem Solving

Description

Resource summary

Media attachments

Similar

	Created by Simon Howe about 7 years ago