9237866
Descripción
Mapa Mental por Lyndsay Hope, actualizado hace más de 1 año
|
Creado por Lyndsay Hope
hace más de 7 años
|
|
GCSE Computer Science: Algorithms
- Representing
Algs
- Pseudocode
- Flowcharts
- Inputs
Processes
Outputs
- Sequence
Selection
Iteration
- Pseudocode
- Efficiency
- One problem ->
many algorithms
- eg Bubble
Merge Quick
sorts
- eg Bubble
Merge Quick
sorts
- Time
- Different algs give
same result
- Fast or slow?
- Fast or slow?
- Different algs give
same result
- One problem ->
many algorithms
- Searching
Algs
- Linear
- Binary
- Linear
- Sorting
Algs
- Bubble
- Merge
Nota:
- MergeSort (Array(First..Last)) Begin If Array contains only one element Then Return Array Else Middle= ((Last + First)/2) rounded down to the nearest integer LeftHalfArray = MergeSort(Array(First..Middle)) RightHalfArray = MergeSort(Array(Middle+1..Last)) ResultArray = Merge(LeftHalfArray, RightHalfArray) Return ResultArray EndIf End MergeSort
- Bubble
- Definitions
- Decomposition
- breaking a problem into a number of
sub-problems, so that each sub- problem
accomplishes an identifiable task
- breaking a problem into a number of
sub-problems, so that each sub- problem
accomplishes an identifiable task
- Abstraction
- the process of removing
unnecessary detail from a
problem
- the process of removing
unnecessary detail from a
problem
- Algorithm
- A sequence of instructions to complete a task
in a finite amount of time
- A sequence of instructions to complete a task
in a finite amount of time
- Decomposition
¿Quieres crear tus propios Mapas Mentales gratis con GoConqr? Más información.