Use LEFT and RIGHT arrow keys to navigate between flashcards;
Use UP and DOWN arrow keys to flip the card;
H to show hint;
A reads text to speech;
9 Cards in this Set
- Front
- Back
|
The steps for insertion sort are |
Step through list Insert each item into correct position relative to items before it Repeat until all items have been inserted into correct positions |
|
|
Steps for Quick Sort |
Select item at random to be pivot Create two new lists one greater than and one less than the pivot Repeat until each list has only one item |
|
|
One advantage of binary search compared to linear search |
Faster in large sets of data |
|
|
What is a dynamic data structure |
Size is not fixed and can change during processing |
|
|
What is a static data structure |
Fixed size. Cannot change during processing. |
|
|
Steps to pop data off a stack |
Check if stack is empty If stack is empty report error If not output stack pointer Decrement stack pointer |
|
|
Steps to push data onto a stack |
Check if stack is full. If stack is full report error Else increment stack pointer Insert data item at stack pointer address |
|
|
Describe the situation in which free and front pointers have the same value in a queue |
Queue must be empty |
|
|
State one feature of quick sort which is not used in insertion sort |
Uses pivots Sets of numbers broken into multiple sets |
