Standard Methods of a Solution

Question 1

What is a searching algorithm?

Answer 1

Searching algorithms are precise step-by-step instructions that a computer can follow to efficiently locate specific data in massive datasets.

Question 2

What is a sorting algorithm?

Answer 2

Sorting algorithms are precise step-by-step instructions that a computer can follow to efficiently sort data in massive datasets.

Question 3

What is a linear search?

Answer 3

• Checks each item in a dataset one by one
• Can work on unsorted data

Question 4

How does a linear search work?

Answer 4

1️⃣ Check the first value
2️⃣ If it’s the target value → STOP
3️⃣ Else, move to the next value
4️⃣ Repeat until the value is found or all values are checked

Question 5

What is a bubble - sort?

Answer 5

• A simple sorting algorithm
• Compares pairs of values and swaps them if out of order
• One full run through the list = a pass
• Repeats passes until no swaps are needed

Question 6

How does a bubble - sort work?

Answer 6

1️⃣ Compare the first two values
2️⃣ If in wrong order → swap them
3️⃣ Move to the next pair
4️⃣ Repeat until end of list (1 pass)
5️⃣ If swaps made → start another pass
6️⃣ If no swaps → STOP, list is sorted

Question 7

Totalling Example

Answer 7

Total ← 0
FOR Count ← 1 TO ReceiptLength
INPUT ItemValue
Total ← Total + ItemValue
NEXT Count
OUTPUT Total

Question 7

What is totalling?

Answer 7

Totalling is keeping a running total of values entered into the algorithm

Question 8

What is counting?

Answer 8

• Counting is when a count is incremented or decremented by a fixed value, usually 1, each time it iterates
• Counting keeps track of the number of times an action has been performed

Question 9

Counting Example

Answer 9

Count ← 0
DO
OUTPUT “Pass number”, Count
Count ← Count + 1
UNTIL Count >= 50