Busy. Please wait.

show password
Forgot Password?

Don't have an account?  Sign up 

Username is available taken
show password


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.

Remove ads
Don't know
remaining cards
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:
restart all cards

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

Union-Find Algorithm

Data Structures

What operations are there for disjoint subsets? (UF algs) Find, connected, create unions
Signature of operation find: subset find(element x)
Signature of operation connected: boolean connected(element x, element y)
Signature of operation create union: void union(element x, element y)
How do we represent sets for UF algs: Array of ints, where K is an element, and a[k] is what it points to.
In large sets, traditional UF operations take how much time (worst case)? O(n)
How do we reduce the time it takes in larger sets? Make each element we pass in find operation point to the "root"
Created by: bwills86