Algorithms

 Algorithms

  • An algorithms is a set of step by step instructions, to solve a problem
  • it can be used to automate calculations, sort arrays, etc
  • they are easy to understand, and due to being broken down into simple instructions, can be easily converted to code
  • however, they can be time consuming to create, and may be difficult to make for more complex tasks
  • the characteristics of algorithms are:

finiteness

  • the algorithm should solve the problem in a given number of steps, an algorithm cannot have an infinite number of steps, and should have an end

Unambiguousness

  • the steps in an algorithm must be clear and precise, each user should be able to understand what the algorithm does

inputs and outputs

  • inputs and output in the algorithm should be clearly defined, each algorithm should have at least 1 output, the output should meet the defined purpose of the algorithm

Logical sequence of steps

  • the algorithm's steps should follow a logical sequence, it should be step by step, with no going backwards, it should be logical

iteration

  • the algorithm should use steps that carry out based on previous steps, the steps should be repeated until the desired output is produced, however the iteration must use a finite amount of steps 

Selection

  • any input in the algorithm should lead to a specified step(s), inputs can be used in a range of steps if necessary 

Independent

  • the algorithm should have its directions be independent of any programming code, this is so it can then be put into any programming code

 Feasibility

  • the algorithms should provide a feasible solution to the problem

Structured English

  • the algorithm should use structured English, allowing non-programmers to understand what it does

Comments

Popular posts from this blog

ESP overview

Stakeholder roadmap

hw 12/5