Printable Flashcards

Algorithm that searches for a specific element in a list or array by checking each element one at a time.	Algorithm that searches a list or array one item at a time in a linear fashion.
A position number indicating the location of an element within an array or list.	An ordered collection of data.
A list that is not sorted according to any specific criterion.	The process of finding a specific value within an array or list.
A step-by-step process for solving a problem or achieving a specific goal.	An operation used in a linear search to compare each element of the list with the specified value.

A measure of how much time and/or space is required to execute an algorithm or program.	The time taken to execute an algorithm or program.
The scenario in which an algorithm takes the longest time to complete.	A measure of time complexity in which the execution time increases linearly with the size of the input.
The scenario in which an algorithm's execution time falls between the best-case and worst-case scenarios.	The scenario in which an algorithm takes the shortest time to complete.
A mathematical notation used to describe the time complexity of an algorithm.	A measure of how well an algorithm uses time and/or space resources.

A collection of elements of the same data type, stored in contiguous memory locations.	The notation used to indicate linear complexity, where n is the size of the input.
A data type that can have one of two possible values, usually true or false.	A single item in an array or list.