Fichas
algorithms
Fichas del conjunto (22)
- 1key2-6 searches
7 gates
8-15 stuff needed to know
16 validation - 2linear searchlooking through numbers one by one until they find the target number, it doesn't have to be order
- 3binary searchit has to be in order, it halves the list and sees if it is smaller or larger then the target
- 4bubble sortgoes through the list in twos and swaps them, to make it , it's slow but easy to program
- 5insertion sorta lot like bubble search but it goes through multiple numbers and is quicker
- 6merge sortdivides the list until there is just one item in a list, then they MERGE them back putting the bigger one to the side until all items are in order and one list
- 7not and orno c not z
- 8truth tableto be
- 9trace tableto be
- 10real/floating numberto be
- 11arrayto be
- 12interger...
- 13iterationnot to be
- 14selectionbox
- 15sequence6, 6, 6
- 16new subjectnew subject
- 17validationto check if the data is wanted or acceptable
- 18range checkonly allowing a certain set of data
- 19present checka check to see if the person wrote something
- 20exceptionsto allow something to not make the program crash
- 21length checka check to make sure it is in between a certain length
- 22Gigo (G.I.G.O)garbage in, garbage out-
if the input data is incorrect so will the output the computer gives
Información
- Descripción
- GCSE Computing Fichas sobre algorithms, creado por Lucy-jane Carey el 09/01/2017.
- Creado por
- Lucy-jane Carey
- Visitas
- 0
- Valoración