Busy. Please wait.
or

show password
Forgot Password?

Don't have an account?  Sign up 
or

Username is available taken
show password

why


Make sure to remember your password. If you forget it there is no way for StudyStack to send you a reset link. You would need to create a new account.
We do not share your email address with others. It is only used to allow you to reset your password. For details read our Privacy Policy and Terms of Service.


Already a StudyStack user? Log In

Reset Password
Enter the associated with your account, and we'll email you a link to reset your password.
Don't know
Know
remaining cards
Save
0:01
To flip the current card, click it or press the Spacebar key.  To move the current card to one of the three colored boxes, click on the box.  You may also press the UP ARROW key to move the card to the "Know" box, the DOWN ARROW key to move the card to the "Don't know" box, or the RIGHT ARROW key to move the card to the Remaining box.  You may also click on the card displayed in any of the three boxes to bring that card back to the center.

Pass complete!

"Know" box contains:
Time elapsed:
Retries:
restart all cards
share
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

Computer Science 345

TermDefinition
Stable A sorting algorithm is __________ if it preserves the original relative ordering of records that match on the key value being sorted.
Internal An algorithm is __________ if it processes and sorts data entirely within the computer's memory; i.g. all the data it works with fits into memory
In-place An algorithm is said to be a(n) __________ algorithm if it does not require additional memory (or very little, i.g. temporary local variables) to operate.
External An algorithm is __________ if it processes and sorts data within the computer's external memory; the data may be larger than what can fit into memory.
Bubble Sort procedure( A[]:list ){ do{ didSwap = false; for(int i=1; i<=A.length;i++){ if( A[i-1] > A[i]) { swap( A[i-1], A[i] ) didSwap = true; } } } while(didSwap); }
Optimized bubble sort procedure( A[]:list ){ n =A.length; do{ didSwap = false; for(int i=1; i<=n-1;i++){ if( A[i-1] > A[i]) { swap( A[i-1], A[i] ) didSwap = true; } } n = n - 1; } while(di
Graph A Graph G=(V,E) is described by a set of vertices V, and a set of ordered pairs E, such that |V|≠0 and E is a binary relation on V.
Path Sequence of Connected Vertices.
Created by: 329600587