Terms in this set (9)
Act of representing essential features without including the background details or explanations. It is used to reduce complexity and allow efficient design and implementation of complex software systems.
Breaking a complex problem or system into parts that are easier to conceive, understand, program, and maintain.
The process of solving problems using a series of steps.
A method for finding a target value within a list. It sequentially checks each element of the list for the target value until a match is found or until all the elements have been searched.
Looking for an item in an already sorted list by eliminating half of the data on each comparison
A sort in which the first two items to be sorted are examined and exchanged if necessary to place them in the specified order; the second item is then compared with the third (exchanging them if required), the third is compared with the fourth, and the process is repeated until all pairs have been examined and all items are in the proper sequence.
A simple sorting algorithm that builds the final sorted array (or list) one item at time. It is much less efficient on large lists than more advanced algorithms such as quicksort, heapsort, or merge sort.
A list is split into individual lists, these are then combined (2 lists at a time).
Simplified programming code that is not language specific, used to design algorithms.