Karteikarten
Algorithms
Karten in diesem Stapel (8)
- 1What is an algorithmset of instructions for solving a problem or task
- 2Decompositionbreaking down big problem into sub-problems: sub-problems break down into tasks/modules
- 3Advantage of Decompositionproblem becomes easier to solve
modules will be reusable - 4Binary searchlist is halved each time item is examined
- 5Lineareach item is searched until answer is found
- 6Insertion sortsbuilds the final sorted list one item at a time. It is much less efficient on large lists
- 7Bubble sortsrepeatedly steps through the list to be sorted, items swapped if they are in the wrong order
named for the way smaller or larger elements "bubble" to the top of the list. - 8How to pseudocode+Start by writing down the purpose of the process. ...
+Write initial steps of pseudocode that +Set the stage for functions. ...
+Write functional pseudocode. ...
+Add comments, if necessary. ...
+Read over the finished project for logic and syntax errors. ...
+Review the pseudocode. ...
+Save your pseudocode.
Informationen
- Beschreibung
- GCSE Computing Karteikarten am Algorithms, erstellt von Alex Cochrane am 26/04/2017.
- Erstellt von
- Alex Cochrane
- Aufrufe
- 4
- Bewertung