1/11
Looks like no tags are added yet.
Name | Mastery | Learn | Test | Matching | Spaced |
---|
No study sessions yet.
Sequencing
The sequential execution of steps in an algorithm or code in a program (like steps in a recipe)
Selection
A Boolean condition to determine which of two paths are taken in an algorithm or program
Iteration
The repetition of steps in an algorithm or program for a certain amount of times or until a certain condition is met
Linear search
An algorithm that iterates through each item in a list until it finds the target value
Binary search
An algorithm that searches a sorted list for a value by repeatedly splitting the list in half
Reasonable time
A run time for an algorithm that doesn't increase faster than a polynomial function of the input size. An unreasonable run time would increase superpolynomially
Heuristic
A technique that helps an algorithm find a good solution in a hard problem
Undecidable problem
A problem that is so logically difficult, we can’t ever create an algorithm that would be able to answer "yes or "no" for all inputs
Library
A collection of procedures that are useful in creating programs
Application Programming Interface (API)
A library of procedures and a description of how to call each procedure
Modularity
The separation of a program into independent modules that are each responsible for one aspect of the program's functionality
Traversal
Iteration over the items in a list