Fichas
2.1 Algorithms
Fichas del conjunto (11)
- 1AbstractionRepresenting 'real world' problems in a computer using variables and symbols and removing unnecessary elements from the problem.
- 2DecompositionBreaking big problems into smaller sub-problems.
- 3Algorithmic ThinkingA way of getting to a solution by identifying the individual steps needed.
- 4Linear search.Each item in the list is checked in order :
Doesn’t require data to be in any order
Inefficient with big amounts of data
Data stored in lists and files - 5Binary search.An ordered list is divided into 2 with each comparison.
- 6Bubble sort.Sorting data in an order
The first value is taken and compared to the next one
Program sees which letter the word starts with
If not in right order, swap over
If in the right order, check next two
Repeat over until all items are sorted - 7Merge sortMore efficient than bubble sort
Harder to program
Split the list into lists of 1 item
Comparing adjacent list at the same time
New lists of 2 items with the correct order
Comparing new lists
New lists of 2^n items with the correct order
Remaining lists merged and compared. - 8Insertion sortInserting values from the unsorted list into a new, blank list.
First value into the new list.
If the second value added is greater first value moves up a 'slot'.
The process is repeated until the sorted data set is created. - 9FlowchartsFlowcharts help with abstraction and decomposition
They can help writing your code - 10PseudocodeHalfway between English and programming language.
Generic code that can be applied to any programming language - 11—
Información
- Descripción
- Fichas sobre 2.1 Algorithms, creado por Kacper Slodek el 12/03/2019.
- Creado por
- Kacper Slodek
- Visitas
- 0
- Valoración