Output - Any information of data which leaves a system, Binary Search - Calculate the mid point. Check if that is the item to find. If not, if it is lower than the midpoint, repeat on the left half of the list, or repeat on the right half of the list., Flowchart - A graphical representation of an algorithm, Decision - The diamond shape of a flow diagram, Abstraction - Including the necessary details and leaving out the unnecessary details when problem solving, Input - Any information or data which goes into a system, Decomposition - Breaking a problem down into smaller sub-problems, making the overall problem easier to solve, Process - Anything which happens to information or data during a program's execution, Bubble Sort - Compare adjacent elements, swap if necessary, repeat until sorted., Terminal - Rounded rectangle / oval shape of a flow diagram, Structure Diagram - show how different parts of a program or system are organised and connected, Input/Output - The parallelogram shape of a flow diagram , Linear Search - Starting from the beginning of a list, each item is checked in turn to see if it is the one being looked for, Algorithmic Thinking - Break down problems into smaller, manageable steps, design a sequence of instructions to solve them, and consider efficiency and correctness of solutions., Rectangle - The shape for a process in a flow diagram, Insertion Sort - Take elements from unsorted part and insert them into sorted part one by one until all are sorted., Arrow - represents control passing between connected shapes in a flow diagram, Merge Sort - Divide the list into smaller sublists, sort each sublist individually, then merge them back together in the correct order., Pseudocode - Half English, half code,

2.1 Algorithms Recap

Одштампај
Угради

Табела

Визуелни стил

Поставке

Промени шаблон

Врати аутоматски сачувано: ?