standard methods of a solution

A searching algorithm is a set of precise step-by-step instructions that a computer can follow to efficiently locate specific data in massive datasets.

A linear search is a searching algorithm that starts with the first value in a dataset and checks every value one at a time until the value has been found or all values have been checked.

False. ** A linear search can be performed even if** the values are not in order.

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

A bubble sort is a simple sorting algorithm that starts at the beginning of a dataset and checks values in 'pairs', swapping them if they are not in the correct order.

In a bubble sort, a 'pass' refers to one full run of comparisons from beginning to end of the dataset.

False. A bubble sort may require multiple passes, but it stops when there are no more swaps to make.

The primary difference is that linear search is used to find a specific value in a dataset, while bubble sort is used to arrange all values in a dataset in a specific order.

The bubble sort algorithm finishes when there are no more swaps to make in a complete pass through the dataset.

In a bubble sort, a "swap" refers to the exchange of positions between two adjacent elements when they are found to be in the wrong order.

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

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

False. Counting can be used to both increment and decrement values.

In algorithms, "max" refers to finding the largest value in a list or dataset.

In algorithms, "min" refers to finding the smallest value in a list or dataset.

The average (mean) is typically calculated by summing all values and dividing by the number of values.

The purpose of using a loop in a totalling algorithm is to iterate through all values in a list or dataset, adding each to the running total.

False. The initial value of a total variable is typically set to 0 before starting the summation process.

In pseudocode, the LENGTH() function typically returns the number of elements in a list or array.

Iteration in algorithms refers to the repetition of a process or set of instructions, often implemented using loops.