Help
Options
Didn't know it?
click below
click below
Knew it?
click below
click below
Don't Know
Remaining cards (0)
Know
retry
shuffle
restart
0:00
Embed Code - If you would like this activity on your web page, copy the script below and paste it into your web page.
Normal Size Small Size show me how
Normal Size Small Size show me how
OOP
Object Oriented Programming terms Searching and Sorting
| Term | Definition |
|---|---|
| binary search | A search algorithm that finds the position of a target value within a sorted list by repeatedly comparing the target value to the middle element of parts of the list. |
| insertion sort algorithm | A simple sorting algorithm that builds the final sorted array or list one item at a time. |
| linear search | A search algorithm that finds the position of a target value within a list by starting at the beginning and examining each element until the target is found. |
| sort key | Used to place data in ascending or descending order |
| selection sort | A sort algorithm which repeatedly finds the next largest (or smallest) element in the data and moves it to its final position in the sorted list. |
| merge sort | A sort algorithm that divides an input array in two halves and then calls itself for the two halves and then merges the two sorted halves. |
| sequential | in order |
| iteration | A single cylce of a repeated programming operation. |
| algorithm | A procedure or formula for solving a problem. |
| middle element | tested in the first iteration of the binary search algorithm |
| search key | used to determine whether a value is present in data, and if so, finding its location. |
| position | Used to set the greatest level of control over a GUI's appearance. |
Created by:
phurlbut
Popular Computers sets