| ascending order
| A | sections used in some sorting algorithms
|
| bubble sort
| B | the process of arranging the items in a data structure in a certain order
|
| descending order
| C | a sorting algorithm that compares elements d positions away from each other
|
| divide and conquer approach
| D | arranged from Z to A or largest to smallest
|
| external sort
| E | a sorting method that repeatedly breaks the unsorted list down into smaller lists until each small list is sorted
|
| incremental approach
| F | an incremental sort in which the elements are arranged in a similar manner to a hand of cards
|
| input size
| G | a sorting algorithm that uses an incremental approach. After the first pass through the list, the element with the largest key value is sorted. After each successive pass, the next largest element is put in its proper position until all elements are sorted.
|
| insertion sort
| H | arranged from A to Z or smallest to largest
|
| key field
| I | an algorithm which repeatedly merges smaller sorted lists into larger ones
|
| key value
| J | an incremental sort which repeatedly compares adjacent elements of an array, starting with the first and second elements, and swapping them if they are out of order
|
| merge sort
| K | the value in a key field
|
| partitions
| L | the field upon which a search algorithm or the sorting of data is based
|
| quicksort
| M | a sorting algorithm characterized by loops that pass through a list, one element at a time
|
| selection sort
| N | a sort that sorts data in a file, rather than in RAM
|
| Shell sort
| O | the number of elements in a list to be sorted
|
| sorting
| P | a sorting algorithm that uses a divide and conquer approach and works by repeatedly breaking the list into partitions until each partition contains a single element
|