Algorithms, Sorting and Searching Flashcards
What is abstraction?
The computational process of removing elements of a code or program that are not relevant.
What is decomposition?
The process of breaking down a problem into smaller sub-problems.
What is computational thinking?
A problem-solving technique that imitates the process programmers go through when writing computer programmes and algorithms.
What is linear search?
Linear search is the simplest form of searching. It is when an algorithm sorts through elements in a list one by one until a match is found.
What is binary search?
A search method used by algorithms that splits a list into smaller sub-lists, which are constantly split until a match is found, or if the match is within the range of the sub-lists.
What is bubble sort?
A sorting method used by algorithms, where it goes through a list a number of times, comparing elements in pairs over and over to determine the correct order.
What is merge sort?
An efficient sorting method used by algorithms which splits a list into individual elements, and then sorts them by combining them in to doubling groups each time until a new list is made.
What is insertion sort?
A sorting method where an element is compared to another element in a pair. If the element on the left is smaller than or equal to the one on the right, no change is made. Otherwise, the element on the right is constantly moved left until the former condition is met.
What is casting?
The process of converting an object into a different data type (implicit means automatic and explicit means using a function)
