1:00
Click the first and last characters of the items you find.
en
WO
20
Bubble sort : A simple sorting algorithm that works by repeatedly stepping through a list, comparing each pair of adjacent items and swapping them if they are in the wrong order. (2 words)
Selection sort : A sorting algorithm that sorts a list into an unsorted sublist and a sorted sublist. It repeatedly finds the smallest element in the unsorted sublist and swaps it with the leftmost unsorted element. (2 words)
Insertion sort : A sorting algorithm that builds the final sorted array one item at a time by removing an item, finding the location it belongs within the sorted list, and inserting it there. (2 words)
N squared : Average performance for bubble sort, selection sort, and insertion sort. (2 words)
N log n : Average performance for tree sort, merge sort, quicksort and heapsort. (3 words)
Tree sort : A sorting algorithm that builds a binary search tree from the keys to be sorted, and then traverses the tree (in-order) so that the keys come out in sorted order.
Merge sort : A sorting algorithm that repeatedly divides a list until each element is a separate list. It then combines and sorts adjacent lists until the whole list is fully sorted. (2 words)
Quicksort : A sorting algorithm that divides the list into two sublists: elements lower than a specific value and elements higher than a specific value.
Pivot : In the quicksort algorithm, the element used to divide the list is called the _____ value.
Partition : In the quicksort algorithm, the _________ operation reorders the list so that the elements are ordered into low values and high values compared to a specific value.
Bucket sort : A distribution sort which works by separating a list into a number of containers which are sorted individually. The containers are visited in order and the elements are put back into the array. (2 words)
Distribution sort : Type of sorting algorithm where data is distributed from input to multiple intermediate structures which are then gathered in order and output. (2 words)
Counting sort : A sorting algorithm which operates by counting the number of objects that have each distinct key value, then determining the positions of each key value based on the counts. (2 words)
heapsort : A sorting algorithm that builds a heap out of the data, then repeatedly removes the largest element from the heap and inserts it into the sorted list.
Comparison : Most sorting algorithms are __________-based.
Divide and conquer : Merge sort and quicksort are ______ ___ ______ algorithms. (3 words)
Stable : When a sorting algorithm keeps elements with the same value in the same order they appear in the original list, it is said to be ______.
Bogosort : A humorous sorting algorithm which randomly permutes the list and checks to see if it’s sorted.
Spacetime tradeoff : A situation where memory use can be reduced at the cost of a slower program (and, conversely, the computation time can be reduced at the cost of increased memory use) is called _____-____ ________ (3 words)
Permutation : The output from a sort algorithm is one ___________, or re-ordering, of the input.
U | S | U | U | N | Q | T | V | P | C | T | W | U | O | W | O | C | C | F | L | G | X | L | H | Q | A | J | X | P | V |
N | N | B | Q | M | S | E | D | I | S | T | R | I | B | U | T | I | O | N | S | O | R | T | D | D | J | N | T | B | R |
P | E | T | L | G | O | Q | T | Q | U | X | O | G | C | S | J | R | M | S | T | L | L | B | S | Z | O | S | Q | J | D |
I | O | T | I | O | P | C | U | Z | E | R | R | P | L | Z | W | P | F | E | B | F | K | W | K | S | O | G | Y | Y | I |
J | X | V | E | J | F | K | O | A | T | X | T | I | T | Z | U | I | C | L | B | P | K | J | I | A | I | X | R | Y | M |
K | C | Y | B | Y | S | C | T | U | R | J | T | V | C | L | T | A | T | E | U | R | P | R | Y | G | D | C | A | F | D |
R | H | C | U | P | L | P | N | O | N | E | C | A | Z | U | J | M | Y | C | W | X | A | S | K | B | N | A | G | D | U |
K | G | G | P | X | B | Z | Z | N | F | T | D | P | E | A | G | K | J | T | V | P | T | P | H | K | A | L | Y | R | B |
I | U | I | N | E | F | E | X | L | L | J | I | O | W | F | Q | T | U | I | M | C | F | A | E | J | O | Y | W | P | U |
D | Y | F | V | T | R | W | E | C | H | O | H | N | K | X | D | X | I | O | R | L | G | C | V | W | Q | C | T | R | B |
I | O | R | Q | P | U | M | Z | S | O | B | G | F | G | K | V | E | C | N | R | A | D | E | Q | Z | I | R | E | Q | B |
V | T | A | U | W | T | F | U | P | U | A | G | N | D | S | L | V | Y | S | Y | N | W | T | U | Y | O | K | L | W | L |
I | N | W | I | F | Q | S | Y | T | P | C | H | H | S | S | O | D | L | O | K | F | F | I | F | S | B | L | G | D | E |
D | T | E | C | A | Z | U | K | I | A | O | G | R | K | C | I | R | M | R | I | G | A | M | E | A | O | N | H | V | S |
E | Q | U | K | V | U | H | N | D | R | T | Q | O | Y | J | G | E | T | T | T | Y | I | E | D | T | G | U | O | K | O |
A | D | Q | S | H | I | B | F | P | T | A | I | E | J | O | F | D | H | O | W | Z | R | T | Y | Q | O | P | E | I | R |
N | D | E | O | H | E | Y | I | X | I | R | T | O | S | W | X | G | M | Q | W | T | S | R | H | I | S | E | B | B | T |
D | I | N | R | C | X | I | N | R | T | V | C | F | N | B | P | V | L | U | H | T | W | A | U | R | O | H | E | V | S |
C | R | T | T | I | U | D | S | O | I | S | S | N | X | E | K | Q | X | R | R | N | X | D | U | N | R | B | D | J | Y |
O | F | U | Y | B | R | A | E | M | O | U | L | B | N | K | Y | G | R | O | N | O | A | E | E | D | T | Y | S | N | A |
N | E | B | B | K | I | U | R | R | N | P | X | Y | E | A | A | C | S | W | D | V | U | O | U | I | P | S | H | V | O |
Q | C | L | J | S | K | J | T | G | H | I | Z | W | L | O | A | P | Y | Z | S | L | Q | F | Q | I | T | A | D | O | G |
U | D | O | E | T | S | Q | I | Q | T | V | R | D | D | G | A | J | T | R | T | S | U | F | U | O | S | K | S | S | P |
E | D | T | E | A | G | N | O | R | P | O | J | C | W | E | J | Q | B | E | F | J | Z | U | Z | S | J | J | W | X | Y |
R | V | Z | S | B | F | M | N | T | G | T | G | A | H | T | F | L | D | O | N | C | Y | A | S | G | X | A | S | G | P |
B | Q | C | V | L | B | T | S | B | A | U | U | I | U | W | D | S | Z | Y | L | U | W | F | Q | M | W | U | P | S | N |
M | C | F | N | E | W | M | O | E | U | D | J | W | I | U | E | N | B | Y | Z | F | Y | Y | W | S | H | L | A | F | O |
Y | A | E | J | Q | X | P | R | E | N | Z | C | B | L | D | C | K | B | U | C | K | E | T | S | O | R | T | X | V | X |
W | G | F | G | G | S | E | T | Z | X | O | I | A | W | J | K | C | E | M | E | R | G | E | S | O | R | T | B | G | O |
Z | R | Y | I | J | G | J | G | U | I | D | E | X | I | K | H | G | K | I | T | J | C | F | I | U | Q | S | B | C | F |
- A humorous sorting algorithm which randomly permutes the list and checks to see if it’s sorted.
- A simple sorting algorithm that works by repeatedly stepping through a list, comparing each pair of adjacent items and swapping them if they are in the wrong order. (2 words)
- A distribution sort which works by separating a list into a number of containers which are sorted individually. The containers are visited in order and the elements are put back into the array. (2 words)
- Most sorting algorithms are __________-based.
- A sorting algorithm which operates by counting the number of objects that have each distinct key value, then determining the positions of each key value based on the counts. (2 words)
- Type of sorting algorithm where data is distributed from input to multiple intermediate structures which are then gathered in order and output. (2 words)
- Merge sort and quicksort are ______ ___ ______ algorithms. (3 words)
| - A sorting algorithm that builds a heap out of the data, then repeatedly removes the largest element from the heap and inserts it into the sorted list.
- A sorting algorithm that builds the final sorted array one item at a time by removing an item, finding the location it belongs within the sorted list, and inserting it there. (2 words)
- A sorting algorithm that repeatedly divides a list until each element is a separate list. It then combines and sorts adjacent lists until the whole list is fully sorted. (2 words)
- Average performance for tree sort, merge sort, quicksort and heapsort. (3 words)
- Average performance for bubble sort, selection sort, and insertion sort. (2 words)
- In the quicksort algorithm, the _________ operation reorders the list so that the elements are ordered into low values and high values compared to a specific value.
- The output from a sort algorithm is one ___________, or re-ordering, of the input.
| - In the quicksort algorithm, the element used to divide the list is called the _____ value.
- A sorting algorithm that divides the list into two sublists: elements lower than a specific value and elements higher than a specific value.
- A sorting algorithm that sorts a list into an unsorted sublist and a sorted sublist. It repeatedly finds the smallest element in the unsorted sublist and swaps it with the leftmost unsorted element. (2 words)
- A situation where memory use can be reduced at the cost of a slower program (and, conversely, the computation time can be reduced at the cost of increased memory use) is called _____-____ ________ (3 words)
- When a sorting algorithm keeps elements with the same value in the same order they appear in the original list, it is said to be ______.
- A sorting algorithm that builds a binary search tree from the keys to be sorted, and then traverses the tree (in-order) so that the keys come out in sorted order.
|
© 2013
PuzzleFast.com, Noncommercial Use Only
U | S | U | U | N | Q | T | V | P | C | T | W | U | O | W | O | C | C | F | L | G | X | L | H | Q | A | J | X | P | V |
N | N | B | Q | M | S | E | D | I | S | T | R | I | B | U | T | I | O | N | S | O | R | T | D | D | J | N | T | B | R |
P | E | T | L | G | O | Q | T | Q | U | X | O | G | C | S | J | R | M | S | T | L | L | B | S | Z | O | S | Q | J | D |
I | O | T | I | O | P | C | U | Z | E | R | R | P | L | Z | W | P | F | E | B | F | K | W | K | S | O | G | Y | Y | I |
J | X | V | E | J | F | K | O | A | T | X | T | I | T | Z | U | I | C | L | B | P | K | J | I | A | I | X | R | Y | M |
K | C | Y | B | Y | S | C | T | U | R | J | T | V | C | L | T | A | T | E | U | R | P | R | Y | G | D | C | A | F | D |
R | H | C | U | P | L | P | N | O | N | E | C | A | Z | U | J | M | Y | C | W | X | A | S | K | B | N | A | G | D | U |
K | G | G | P | X | B | Z | Z | N | F | T | D | P | E | A | G | K | J | T | V | P | T | P | H | K | A | L | Y | R | B |
I | U | I | N | E | F | E | X | L | L | J | I | O | W | F | Q | T | U | I | M | C | F | A | E | J | O | Y | W | P | U |
D | Y | F | V | T | R | W | E | C | H | O | H | N | K | X | D | X | I | O | R | L | G | C | V | W | Q | C | T | R | B |
I | O | R | Q | P | U | M | Z | S | O | B | G | F | G | K | V | E | C | N | R | A | D | E | Q | Z | I | R | E | Q | B |
V | T | A | U | W | T | F | U | P | U | A | G | N | D | S | L | V | Y | S | Y | N | W | T | U | Y | O | K | L | W | L |
I | N | W | I | F | Q | S | Y | T | P | C | H | H | S | S | O | D | L | O | K | F | F | I | F | S | B | L | G | D | E |
D | T | E | C | A | Z | U | K | I | A | O | G | R | K | C | I | R | M | R | I | G | A | M | E | A | O | N | H | V | S |
E | Q | U | K | V | U | H | N | D | R | T | Q | O | Y | J | G | E | T | T | T | Y | I | E | D | T | G | U | O | K | O |
A | D | Q | S | H | I | B | F | P | T | A | I | E | J | O | F | D | H | O | W | Z | R | T | Y | Q | O | P | E | I | R |
N | D | E | O | H | E | Y | I | X | I | R | T | O | S | W | X | G | M | Q | W | T | S | R | H | I | S | E | B | B | T |
D | I | N | R | C | X | I | N | R | T | V | C | F | N | B | P | V | L | U | H | T | W | A | U | R | O | H | E | V | S |
C | R | T | T | I | U | D | S | O | I | S | S | N | X | E | K | Q | X | R | R | N | X | D | U | N | R | B | D | J | Y |
O | F | U | Y | B | R | A | E | M | O | U | L | B | N | K | Y | G | R | O | N | O | A | E | E | D | T | Y | S | N | A |
N | E | B | B | K | I | U | R | R | N | P | X | Y | E | A | A | C | S | W | D | V | U | O | U | I | P | S | H | V | O |
Q | C | L | J | S | K | J | T | G | H | I | Z | W | L | O | A | P | Y | Z | S | L | Q | F | Q | I | T | A | D | O | G |
U | D | O | E | T | S | Q | I | Q | T | V | R | D | D | G | A | J | T | R | T | S | U | F | U | O | S | K | S | S | P |
E | D | T | E | A | G | N | O | R | P | O | J | C | W | E | J | Q | B | E | F | J | Z | U | Z | S | J | J | W | X | Y |
R | V | Z | S | B | F | M | N | T | G | T | G | A | H | T | F | L | D | O | N | C | Y | A | S | G | X | A | S | G | P |
B | Q | C | V | L | B | T | S | B | A | U | U | I | U | W | D | S | Z | Y | L | U | W | F | Q | M | W | U | P | S | N |
M | C | F | N | E | W | M | O | E | U | D | J | W | I | U | E | N | B | Y | Z | F | Y | Y | W | S | H | L | A | F | O |
Y | A | E | J | Q | X | P | R | E | N | Z | C | B | L | D | C | K | B | U | C | K | E | T | S | O | R | T | X | V | X |
W | G | F | G | G | S | E | T | Z | X | O | I | A | W | J | K | C | E | M | E | R | G | E | S | O | R | T | B | G | O |
Z | R | Y | I | J | G | J | G | U | I | D | E | X | I | K | H | G | K | I | T | J | C | F | I | U | Q | S | B | C | F |
- BOGOSORT
- BUBBLESORT
- BUCKETSORT
- COMPARISON
- COUNTINGSORT
- DISTRIBUTIONSORT
- DIVIDEANDCONQUER
| - HEAPSORT
- INSERTIONSORT
- MERGESORT
- NLOGN
- NSQUARED
- PARTITION
- PERMUTATION
| - PIVOT
- QUICKSORT
- SELECTIONSORT
- SPACETIMETRADEOFF
- STABLE
- TREESORT
|
© 2013
PuzzleFast.com, Noncommercial Use Only