Upgrade to remove ads
y9 Computing - 2.1b Standard Algorithms (Search/Sort)
Terms in this set (20)
A Sorting Algorithm that passes over the list many times, compares each pair of adjacent items and swaps them if they are in the wrong order.
A sorting algorithm that sorts partial lists then merges them together.
A sorting algorithm where each element in the list is inserted into the correct place in the list one at a time.
Any algorithm that describes how to sort data, examples are Bubble, Insertion and Merge
Rising, going from smallest to largest
Falling, going from largest to smallest
A data structure that can hold many items of the same type of data e.g. names, account numbers - in pseudocode :
names = ["Jon", "Anya", "Zork"]
a Python keyword that starts a loop
a Python keyword that makes a selection
A structured process that finds a target in a set of data
A search algorithm which looks at every element in turn until it finds the target, it is slow but works even on unsorted data
A search algorithm that divides the search space in half each time until it finds the target, faster than linear but requires the array to be sorted.
Python code that represents the nth member of an array called a.
A named value in a computer program that can be changed by the program code as it runs. "temp" and "num" are examples in our bubble sort program.
The item we are searching for in a search algorithm.
used in a binary search
Right hand side of the array including mid point
Discarded if the binary search target value is lower than the value we are comparing it to (the mid point)
Left hand side of the array including mid point
Discarded if the binary search target value is higher than the value we are comparing it to (the mid point)
best-case scenario for binary search
target value is in mid point of the array
best-case scenario for linear search
target value is in the first position of the array
OTHER SETS BY THIS CREATOR
Database - A Level
Programming - Python Review y7