A set of mechanical or sequential steps that are used to take on an input and return an output. Represented by flowcharts, pseudocode or structured English
1 of 7
Recursion
A recursive function is one that calls itself within itself until a base case is met. Often provides a succinct way ro carry out the same operation several times. Examples include factorial calculations
2 of 7
Validation
Checks that occur on data inputs before data is committed to storage such as character, length or format checks
3 of 7
Verification
Checks that occur on data inputs after the data is committed to storage, for example double entry on email addresses or proofreading
4 of 7
Bubble Sort
A simple sorting algorithm that repeatedly steps through the list, compares adjacent pairs and swaps them if they are in the wrong order. The pass through the list is repeated until the list is sorted
5 of 7
Insertion Sort
A sorting algorithm that builds the final sorted array (or list) one item at a time. It is much less efficient on large lists than more advanced algorithms
6 of 7
Quick Sort
Quicksort is an O efficient sorting algorithm, serving as a systematic method for placing the elements of an array in order.
7 of 7
Other cards in this set
Card 2
Front
A recursive function is one that calls itself within itself until a base case is met. Often provides a succinct way ro carry out the same operation several times. Examples include factorial calculations
Back
Recursion
Card 3
Front
Checks that occur on data inputs before data is committed to storage such as character, length or format checks
Back
Card 4
Front
Checks that occur on data inputs after the data is committed to storage, for example double entry on email addresses or proofreading
Back
Card 5
Front
A simple sorting algorithm that repeatedly steps through the list, compares adjacent pairs and swaps them if they are in the wrong order. The pass through the list is repeated until the list is sorted
Comments
No comments have yet been made