A set of instructions in a logical working order
Algorithm
The three primary error types
Syntax, Runtime, Logical
The search method when looking at (potentially) all items
Linear
17 % 3
2
The names of each terminal
Start/Begin & Stop/End
Removing unnecessary details from a problem
Abstraction
The two types of iteration
for and while
The two types of sorting used in this course
Bubble & Merge
5 ** 2
25
The shape used for input and output
parallelogram
Breaking down a large problem into smaller parts
Decomposition
max = int(input())
for i in range(max):
print(i)
Generally, what does i represent?
The search method nicknamed 'Divide & Conquer'
Binary Search
17 // 3
5
The use of these help show a loop is occurring in a flowchart
lines
These are smaller part of code that perform smaller tasks
Subprograms
The three basic structures used in programs
Sequence, Selection, Iteration (or Loops)
The often faster sorting method
Merge sort
((5 * 7) + 3) / 4
9.5
Rhombus (or diamond) shape is used for this
In a bubble, going through all items in a list once is called this
Pass
A benefit of using a subprogram
- reusable code
- less typing/simpler code
- fewer bugs
The worst result in any search method
The item is not found
((3**2) * 4 + 7) // 4
10
To show how a program works without knowing code well, we can use flowcharts and ______
pseudocode