Please enable JavaScript.
Coggle requires JavaScript to display documents.
2.1 Algorithms:, 2.1 - Coggle Diagram
2.1 Algorithms:
-
Algorithmic Thinking
Algorithmic thinking is an instruction that carries out a task, this task can range from complex, to simple.
Example:
-
- Fill up the kettle with water.
- Turn on the kettle and boil the water.
- Put tea bag and sugar into cup.
- Pour the boiled water from the kettle into the cup.
- take out the tea bag and stir.
2.1
2.1.3 Sorting Algorithms
Insertion Sort:
-
-
You take each item in turns and put it in the right place, using the first item as the starting point.
Merge Sort:
-
-
Once fully broke apart, the numbers are put back together into ordered chunks, which are then joined up into a fully ordered list.
Bubble Sort:
From the leftmost number, each is compared to the number to the right. If it is higher than the one to the right, they are swapped. if no swaps have taken place by the end of the list, then it is in order, otherwise, this process starts again.
Once sorted, The numbers will be in ascending order.
-
Computational Thinking
-
Abstraction
For example, in order to make a coffee, you do not need to know how the inside of a coffee machine works, that would be considered useless information.
Abstraction is the action of taking away everything irrelevant from a problem, and leaving everything that is relevant.
In short, keep out unnecessary details, such as bushes, trees, insides of a building ,etc.
-